./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5697d76d3e5ae232d0e056ee307ac88ca38e983a94c4765bc5d51f77e79d2f7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:49:12,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:49:12,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:49:12,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:49:12,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:49:12,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:49:12,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:49:12,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:49:12,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:49:12,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:49:12,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:49:12,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:49:12,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:49:12,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:49:12,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:49:12,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:49:12,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:49:12,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:49:12,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:49:12,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:49:12,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:49:12,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:49:12,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:49:12,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:49:12,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:49:12,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:49:12,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:49:12,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:49:12,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:49:12,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:49:12,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:49:12,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:49:12,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:49:12,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:49:12,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:49:12,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:49:12,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:49:12,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:49:12,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:49:12,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:49:12,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:49:12,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:49:12,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:49:12,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:49:12,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:49:12,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:49:12,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:49:12,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:49:12,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:49:12,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:49:12,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:49:12,105 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:49:12,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:49:12,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:49:12,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:49:12,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:49:12,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:49:12,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:49:12,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:49:12,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:49:12,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:49:12,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:49:12,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:49:12,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:49:12,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:49:12,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:49:12,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:49:12,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:49:12,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:49:12,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:49:12,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:49:12,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:49:12,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:49:12,111 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:49:12,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:49:12,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:49:12,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5697d76d3e5ae232d0e056ee307ac88ca38e983a94c4765bc5d51f77e79d2f7 [2022-07-19 15:49:12,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:49:12,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:49:12,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:49:12,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:49:12,392 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:49:12,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c [2022-07-19 15:49:12,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6dcd14f4/7fbb4caf3e6940109c1cff998d9c9acc/FLAG5b9a1fa69 [2022-07-19 15:49:12,780 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:49:12,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c [2022-07-19 15:49:12,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6dcd14f4/7fbb4caf3e6940109c1cff998d9c9acc/FLAG5b9a1fa69 [2022-07-19 15:49:13,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6dcd14f4/7fbb4caf3e6940109c1cff998d9c9acc [2022-07-19 15:49:13,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:49:13,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:49:13,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:49:13,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:49:13,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:49:13,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2049c147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13, skipping insertion in model container [2022-07-19 15:49:13,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:49:13,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:49:13,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c[490,503] [2022-07-19 15:49:13,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:49:13,414 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:49:13,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound100.c[490,503] [2022-07-19 15:49:13,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:49:13,442 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:49:13,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13 WrapperNode [2022-07-19 15:49:13,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:49:13,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:49:13,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:49:13,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:49:13,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,472 INFO L137 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-19 15:49:13,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:49:13,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:49:13,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:49:13,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:49:13,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:49:13,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:49:13,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:49:13,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:49:13,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (1/1) ... [2022-07-19 15:49:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:49:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:13,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 15:49:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 15:49:13,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:49:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 15:49:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 15:49:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:49:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:49:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:49:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:49:13,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:49:13,622 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:49:13,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:49:13,810 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:49:13,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:49:13,815 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 15:49:13,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:49:13 BoogieIcfgContainer [2022-07-19 15:49:13,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:49:13,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:49:13,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:49:13,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:49:13,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:49:13" (1/3) ... [2022-07-19 15:49:13,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60393979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:49:13, skipping insertion in model container [2022-07-19 15:49:13,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:49:13" (2/3) ... [2022-07-19 15:49:13,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60393979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:49:13, skipping insertion in model container [2022-07-19 15:49:13,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:49:13" (3/3) ... [2022-07-19 15:49:13,824 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound100.c [2022-07-19 15:49:13,852 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:49:13,856 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:49:13,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:49:13,943 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ead0d32, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@497683d0 [2022-07-19 15:49:13,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:49:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 15:49:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 15:49:13,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:13,956 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:13,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1146169762, now seen corresponding path program 1 times [2022-07-19 15:49:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:13,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718911860] [2022-07-19 15:49:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:49:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 15:49:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 15:49:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:49:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 15:49:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 15:49:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:49:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:14,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718911860] [2022-07-19 15:49:14,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718911860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:49:14,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:49:14,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 15:49:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87889233] [2022-07-19 15:49:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:49:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 15:49:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 15:49:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:49:14,224 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 15:49:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:14,255 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2022-07-19 15:49:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 15:49:14,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-07-19 15:49:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:14,264 INFO L225 Difference]: With dead ends: 67 [2022-07-19 15:49:14,265 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 15:49:14,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:49:14,273 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:14,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:49:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 15:49:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 15:49:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 15:49:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-19 15:49:14,323 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 39 [2022-07-19 15:49:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:14,323 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-19 15:49:14,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 15:49:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-19 15:49:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:49:14,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:14,327 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:14,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:49:14,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 846808023, now seen corresponding path program 1 times [2022-07-19 15:49:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:14,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022476458] [2022-07-19 15:49:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:14,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:14,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833379301] [2022-07-19 15:49:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:14,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:14,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 15:49:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:14,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:49:14,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 15:49:14,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 15:49:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:14,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022476458] [2022-07-19 15:49:14,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:14,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833379301] [2022-07-19 15:49:14,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833379301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:49:14,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:49:14,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-19 15:49:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59320116] [2022-07-19 15:49:14,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:14,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:49:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:49:14,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:49:14,737 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 15:49:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:14,864 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-07-19 15:49:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:49:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-07-19 15:49:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:14,870 INFO L225 Difference]: With dead ends: 48 [2022-07-19 15:49:14,871 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 15:49:14,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 15:49:14,874 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:14,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 108 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:49:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 15:49:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-07-19 15:49:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 15:49:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-07-19 15:49:14,884 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 40 [2022-07-19 15:49:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:14,884 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-07-19 15:49:14,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 15:49:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-07-19 15:49:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 15:49:14,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:14,886 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:14,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 15:49:15,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:15,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash 481927254, now seen corresponding path program 1 times [2022-07-19 15:49:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:15,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865059160] [2022-07-19 15:49:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:15,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:15,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953238287] [2022-07-19 15:49:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:15,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:15,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 15:49:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:15,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 15:49:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 15:49:15,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:49:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865059160] [2022-07-19 15:49:15,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953238287] [2022-07-19 15:49:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953238287] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-07-19 15:49:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911922257] [2022-07-19 15:49:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:49:15,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:49:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:49:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 15:49:15,362 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 15:49:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:15,402 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-07-19 15:49:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:49:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2022-07-19 15:49:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:15,404 INFO L225 Difference]: With dead ends: 39 [2022-07-19 15:49:15,404 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 15:49:15,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:49:15,405 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:15,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:49:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 15:49:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-19 15:49:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 15:49:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-07-19 15:49:15,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 41 [2022-07-19 15:49:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:15,415 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-07-19 15:49:15,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 15:49:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-07-19 15:49:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 15:49:15,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:15,419 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:15,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:15,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 15:49:15,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1626076469, now seen corresponding path program 1 times [2022-07-19 15:49:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256067434] [2022-07-19 15:49:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:15,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:15,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416833606] [2022-07-19 15:49:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:15,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:15,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 15:49:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:15,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:49:15,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:49:15,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:49:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:15,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256067434] [2022-07-19 15:49:15,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:15,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416833606] [2022-07-19 15:49:15,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416833606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:49:15,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:49:15,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:49:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171403345] [2022-07-19 15:49:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:49:15,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:49:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:49:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:49:15,836 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 15:49:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:15,877 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-19 15:49:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:49:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-07-19 15:49:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:15,879 INFO L225 Difference]: With dead ends: 50 [2022-07-19 15:49:15,879 INFO L226 Difference]: Without dead ends: 48 [2022-07-19 15:49:15,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:49:15,880 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:15,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 145 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:49:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-19 15:49:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-07-19 15:49:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 15:49:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-07-19 15:49:15,890 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 46 [2022-07-19 15:49:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:15,890 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-07-19 15:49:15,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 15:49:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-07-19 15:49:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 15:49:15,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:15,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:15,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:16,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash 779090230, now seen corresponding path program 1 times [2022-07-19 15:49:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:16,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963220303] [2022-07-19 15:49:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:16,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:16,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203248778] [2022-07-19 15:49:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:16,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:16,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:16,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:16,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 15:49:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:16,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 15:49:16,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 15:49:16,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-19 15:49:16,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963220303] [2022-07-19 15:49:16,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203248778] [2022-07-19 15:49:16,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203248778] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:16,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:16,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-07-19 15:49:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563093256] [2022-07-19 15:49:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:49:16,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:49:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:49:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 15:49:16,430 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 15:49:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:16,487 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-07-19 15:49:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:49:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-07-19 15:49:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:16,490 INFO L225 Difference]: With dead ends: 54 [2022-07-19 15:49:16,490 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 15:49:16,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:49:16,493 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:16,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:49:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 15:49:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-07-19 15:49:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 15:49:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-07-19 15:49:16,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 51 [2022-07-19 15:49:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:16,513 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-07-19 15:49:16,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 15:49:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-07-19 15:49:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 15:49:16,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:16,521 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:16,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:16,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:16,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash -670274197, now seen corresponding path program 1 times [2022-07-19 15:49:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:16,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431374963] [2022-07-19 15:49:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:16,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:16,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066692906] [2022-07-19 15:49:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:16,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:16,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 15:49:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:16,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 15:49:16,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-19 15:49:17,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:17,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431374963] [2022-07-19 15:49:17,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:17,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066692906] [2022-07-19 15:49:17,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066692906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:17,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-19 15:49:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3674577] [2022-07-19 15:49:17,290 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 15:49:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 15:49:17,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 15:49:17,291 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 15:49:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:17,504 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-07-19 15:49:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:49:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-07-19 15:49:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:17,505 INFO L225 Difference]: With dead ends: 60 [2022-07-19 15:49:17,505 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 15:49:17,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-19 15:49:17,506 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:17,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:49:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 15:49:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2022-07-19 15:49:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 15:49:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-07-19 15:49:17,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 56 [2022-07-19 15:49:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:17,516 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-07-19 15:49:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 15:49:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-07-19 15:49:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 15:49:17,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:17,517 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:17,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:17,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash -759965185, now seen corresponding path program 1 times [2022-07-19 15:49:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:17,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643585557] [2022-07-19 15:49:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:17,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:17,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674695976] [2022-07-19 15:49:17,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:17,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:17,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:17,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:17,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 15:49:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:17,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:49:17,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-19 15:49:17,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-19 15:49:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:17,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643585557] [2022-07-19 15:49:17,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:17,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674695976] [2022-07-19 15:49:17,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674695976] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:49:17,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:49:17,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-07-19 15:49:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262790591] [2022-07-19 15:49:17,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 15:49:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 15:49:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 15:49:17,922 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-19 15:49:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:18,129 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2022-07-19 15:49:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 15:49:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 65 [2022-07-19 15:49:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:18,131 INFO L225 Difference]: With dead ends: 102 [2022-07-19 15:49:18,131 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 15:49:18,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:49:18,132 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:18,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 195 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:49:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 15:49:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-19 15:49:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-19 15:49:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2022-07-19 15:49:18,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 65 [2022-07-19 15:49:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:18,149 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2022-07-19 15:49:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-19 15:49:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2022-07-19 15:49:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 15:49:18,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:18,151 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:18,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:18,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:18,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -696294669, now seen corresponding path program 1 times [2022-07-19 15:49:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:18,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402539659] [2022-07-19 15:49:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:18,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:18,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398048171] [2022-07-19 15:49:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:18,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:18,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 15:49:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:18,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 15:49:18,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 15:49:18,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 15:49:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402539659] [2022-07-19 15:49:18,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:18,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398048171] [2022-07-19 15:49:18,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398048171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:49:18,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:49:18,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-07-19 15:49:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037042642] [2022-07-19 15:49:18,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 15:49:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 15:49:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:49:18,711 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-19 15:49:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:19,039 INFO L93 Difference]: Finished difference Result 128 states and 183 transitions. [2022-07-19 15:49:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:49:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 71 [2022-07-19 15:49:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:19,043 INFO L225 Difference]: With dead ends: 128 [2022-07-19 15:49:19,043 INFO L226 Difference]: Without dead ends: 124 [2022-07-19 15:49:19,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-19 15:49:19,044 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:19,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 165 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:49:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-19 15:49:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2022-07-19 15:49:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-19 15:49:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2022-07-19 15:49:19,064 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 71 [2022-07-19 15:49:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2022-07-19 15:49:19,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-19 15:49:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2022-07-19 15:49:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 15:49:19,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:19,066 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:19,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:19,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1352497678, now seen corresponding path program 2 times [2022-07-19 15:49:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:19,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248062069] [2022-07-19 15:49:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:19,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510762658] [2022-07-19 15:49:19,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:49:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:19,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:19,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 15:49:19,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:49:19,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:49:19,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 15:49:19,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 15:49:19,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 15:49:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248062069] [2022-07-19 15:49:19,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:19,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510762658] [2022-07-19 15:49:19,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510762658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:49:19,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:49:19,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-07-19 15:49:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897563568] [2022-07-19 15:49:19,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:19,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:49:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:49:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:49:19,817 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-19 15:49:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:21,162 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2022-07-19 15:49:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 15:49:21,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 76 [2022-07-19 15:49:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:21,172 INFO L225 Difference]: With dead ends: 116 [2022-07-19 15:49:21,172 INFO L226 Difference]: Without dead ends: 114 [2022-07-19 15:49:21,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2022-07-19 15:49:21,175 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:21,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 15:49:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-19 15:49:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-07-19 15:49:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.169811320754717) internal successors, (62), 55 states have internal predecessors, (62), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-19 15:49:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2022-07-19 15:49:21,208 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 76 [2022-07-19 15:49:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:21,210 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2022-07-19 15:49:21,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-19 15:49:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2022-07-19 15:49:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-19 15:49:21,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:21,213 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:21,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:21,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-19 15:49:21,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -421153901, now seen corresponding path program 3 times [2022-07-19 15:49:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493606857] [2022-07-19 15:49:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:21,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:21,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400350463] [2022-07-19 15:49:21,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:49:21,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:21,449 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:21,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 15:49:21,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:49:21,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:49:21,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 15:49:21,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-19 15:49:22,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493606857] [2022-07-19 15:49:22,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400350463] [2022-07-19 15:49:22,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400350463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:22,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-07-19 15:49:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252070938] [2022-07-19 15:49:22,468 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 15:49:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 15:49:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-07-19 15:49:22,470 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-19 15:49:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:23,295 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2022-07-19 15:49:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 15:49:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2022-07-19 15:49:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:23,296 INFO L225 Difference]: With dead ends: 128 [2022-07-19 15:49:23,296 INFO L226 Difference]: Without dead ends: 126 [2022-07-19 15:49:23,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-07-19 15:49:23,297 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:23,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 143 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 15:49:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-19 15:49:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2022-07-19 15:49:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 71 states have internal predecessors, (80), 42 states have call successors, (42), 11 states have call predecessors, (42), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-19 15:49:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2022-07-19 15:49:23,319 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 81 [2022-07-19 15:49:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:23,320 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2022-07-19 15:49:23,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-19 15:49:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-07-19 15:49:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 15:49:23,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:23,321 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:23,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:23,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 15:49:23,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1712962370, now seen corresponding path program 1 times [2022-07-19 15:49:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:23,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277993945] [2022-07-19 15:49:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:23,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:23,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211826956] [2022-07-19 15:49:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:23,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:23,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:23,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 15:49:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:23,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 15:49:23,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 15:49:23,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:24,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277993945] [2022-07-19 15:49:24,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:24,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211826956] [2022-07-19 15:49:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211826956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:24,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:24,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-07-19 15:49:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017099813] [2022-07-19 15:49:24,186 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:24,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 15:49:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 15:49:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-19 15:49:24,187 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-19 15:49:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:24,573 INFO L93 Difference]: Finished difference Result 163 states and 213 transitions. [2022-07-19 15:49:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:49:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 87 [2022-07-19 15:49:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:24,575 INFO L225 Difference]: With dead ends: 163 [2022-07-19 15:49:24,575 INFO L226 Difference]: Without dead ends: 156 [2022-07-19 15:49:24,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-19 15:49:24,576 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:24,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 228 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 15:49:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-19 15:49:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-07-19 15:49:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 84 states have internal predecessors, (95), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-07-19 15:49:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2022-07-19 15:49:24,603 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 87 [2022-07-19 15:49:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:24,603 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2022-07-19 15:49:24,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-19 15:49:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2022-07-19 15:49:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 15:49:24,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:24,605 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 15:49:24,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1899970478, now seen corresponding path program 1 times [2022-07-19 15:49:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:24,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199866122] [2022-07-19 15:49:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:24,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268791834] [2022-07-19 15:49:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:24,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:24,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 15:49:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:49:24,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 15:49:24,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2022-07-19 15:49:25,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199866122] [2022-07-19 15:49:25,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268791834] [2022-07-19 15:49:25,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268791834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:49:25,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:49:25,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-19 15:49:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680328140] [2022-07-19 15:49:25,775 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 15:49:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 15:49:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-19 15:49:25,777 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-19 15:49:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:26,421 INFO L93 Difference]: Finished difference Result 162 states and 211 transitions. [2022-07-19 15:49:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 15:49:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 103 [2022-07-19 15:49:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:26,425 INFO L225 Difference]: With dead ends: 162 [2022-07-19 15:49:26,425 INFO L226 Difference]: Without dead ends: 160 [2022-07-19 15:49:26,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-19 15:49:26,426 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:26,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 207 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 15:49:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-19 15:49:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2022-07-19 15:49:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 87 states have internal predecessors, (98), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-07-19 15:49:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2022-07-19 15:49:26,460 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 103 [2022-07-19 15:49:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:26,461 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2022-07-19 15:49:26,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-19 15:49:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2022-07-19 15:49:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 15:49:26,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:26,462 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:26,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 15:49:26,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 15:49:26,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -992204181, now seen corresponding path program 4 times [2022-07-19 15:49:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297073302] [2022-07-19 15:49:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:26,703 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:26,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473384725] [2022-07-19 15:49:26,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 15:49:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:26,707 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:26,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 15:49:26,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 15:49:26,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:49:26,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 15:49:26,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 15:49:26,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:49:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297073302] [2022-07-19 15:49:26,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473384725] [2022-07-19 15:49:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473384725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:49:26,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:49:26,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:49:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721953820] [2022-07-19 15:49:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:49:26,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:49:26,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:49:26,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:49:26,792 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-19 15:49:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:49:26,861 INFO L93 Difference]: Finished difference Result 200 states and 265 transitions. [2022-07-19 15:49:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:49:26,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 106 [2022-07-19 15:49:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:49:26,862 INFO L225 Difference]: With dead ends: 200 [2022-07-19 15:49:26,863 INFO L226 Difference]: Without dead ends: 144 [2022-07-19 15:49:26,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:49:26,864 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:49:26,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:49:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-19 15:49:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2022-07-19 15:49:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-19 15:49:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2022-07-19 15:49:26,887 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 106 [2022-07-19 15:49:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:49:26,887 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2022-07-19 15:49:26,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-19 15:49:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2022-07-19 15:49:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 15:49:26,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:49:26,889 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:49:26,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 15:49:27,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 15:49:27,096 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:49:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:49:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash -200374723, now seen corresponding path program 2 times [2022-07-19 15:49:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:49:27,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622933545] [2022-07-19 15:49:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:49:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:49:27,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:49:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110458073] [2022-07-19 15:49:27,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:49:27,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:49:27,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:49:27,107 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:49:27,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 15:49:27,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:49:27,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:49:27,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 15:49:27,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:49:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 47 proven. 30 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-19 15:49:28,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:49:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 47 proven. 30 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-19 15:49:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:49:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622933545] [2022-07-19 15:49:34,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:49:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110458073] [2022-07-19 15:49:34,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110458073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:49:34,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:49:34,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-07-19 15:49:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646216625] [2022-07-19 15:49:34,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:49:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 15:49:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:49:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 15:49:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=418, Unknown=2, NotChecked=0, Total=506 [2022-07-19 15:49:34,576 INFO L87 Difference]: Start difference. First operand 134 states and 169 transitions. Second operand has 23 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-19 15:49:37,803 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~b~0#1|)) (.cse0 (<= |c_ULTIMATE.start_main_~b~0#1| 0)) (.cse2 (div |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (and (or (not (= |c_ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 0)) (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~r~0#1| (* (- 1) (* |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|)))) (* |c_ULTIMATE.start_main_~x~0#1| (+ (* (- 1) |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~p~0#1|))) 0) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (or .cse0 (not (= |c_ULTIMATE.start_main_~a~0#1| .cse1)) (= (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| .cse2) (* |c_ULTIMATE.start_main_~x~0#1| .cse2 |c_ULTIMATE.start_main_~q~0#1|)))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~c~0#1| (- 1)) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse3 (div .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= (+ |c_ULTIMATE.start_main_~k~0#1| 1) .cse3)) (<= .cse1 |c_ULTIMATE.start_main_~c~0#1|) (= (+ (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse3 |c_ULTIMATE.start_main_~q~0#1|))) (* |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~r~0#1| (* (- 1) (* .cse3 |c_ULTIMATE.start_main_~s~0#1|))))) 0) (not (= |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (not (= (mod .cse4 |c_ULTIMATE.start_main_~b~0#1|) 0))))) (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* |c_ULTIMATE.start_main_~s~0#1| .cse2)) |c_ULTIMATE.start_main_~r~0#1|)) (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse2 |c_ULTIMATE.start_main_~q~0#1|)))) 0) .cse0 (not (= (mod |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|) 0)) (< .cse2 (+ 2 |c_ULTIMATE.start_main_~k~0#1|)) (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* (- 1) |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))))) is different from true [2022-07-19 15:49:41,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:43,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:45,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:48,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:50,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:52,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:54,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:56,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:49:58,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:00,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:02,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:04,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:06,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:07,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:11,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:13,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:15,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:17,965 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~c~0#1| (- 1)) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (div .cse1 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= (+ |c_ULTIMATE.start_main_~k~0#1| 1) .cse0)) (<= (* 2 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~c~0#1|) (= (+ (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse0 |c_ULTIMATE.start_main_~q~0#1|))) (* |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~r~0#1| (* (- 1) (* .cse0 |c_ULTIMATE.start_main_~s~0#1|))))) 0) (not (= |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (not (= (mod .cse1 |c_ULTIMATE.start_main_~b~0#1|) 0))))) (let ((.cse2 (div |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* |c_ULTIMATE.start_main_~s~0#1| .cse2)) |c_ULTIMATE.start_main_~r~0#1|)) (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse2 |c_ULTIMATE.start_main_~q~0#1|)))) 0) (<= |c_ULTIMATE.start_main_~b~0#1| 0) (not (= (mod |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|) 0)) (< .cse2 (+ 2 |c_ULTIMATE.start_main_~k~0#1|)) (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* (- 1) |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))))) is different from true [2022-07-19 15:50:19,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:21,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:50:42,518 WARN L233 SmtUtils]: Spent 20.22s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:50:45,059 WARN L855 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 0)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~c~0#1| (- 1)) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (div .cse1 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= (+ |c_ULTIMATE.start_main_~k~0#1| 1) .cse0)) (<= (* 2 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~c~0#1|) (= (+ (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse0 |c_ULTIMATE.start_main_~q~0#1|))) (* |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~r~0#1| (* (- 1) (* .cse0 |c_ULTIMATE.start_main_~s~0#1|))))) 0) (not (= |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (not (= (mod .cse1 |c_ULTIMATE.start_main_~b~0#1|) 0))))) (let ((.cse2 (div |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* |c_ULTIMATE.start_main_~s~0#1| .cse2)) |c_ULTIMATE.start_main_~r~0#1|)) (* |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~p~0#1| (* (- 1) .cse2 |c_ULTIMATE.start_main_~q~0#1|)))) 0) (<= |c_ULTIMATE.start_main_~b~0#1| 0) (not (= (mod |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|) 0)) (< .cse2 (+ 2 |c_ULTIMATE.start_main_~k~0#1|)) (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* (- 1) |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~b~0#1|)))) (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~r~0#1| (* (- 1) (* |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|)))) (* |c_ULTIMATE.start_main_~x~0#1| (+ (* (- 1) |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~p~0#1|))) 0) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)))) is different from true [2022-07-19 15:50:56,828 WARN L233 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:51:03,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:51:06,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:51:37,171 WARN L233 SmtUtils]: Spent 29.82s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:51:58,085 WARN L233 SmtUtils]: Spent 18.16s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:52:01,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:03,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:05,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:12,542 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:52:15,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:17,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:19,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:21,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:23,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:52:31,410 INFO L93 Difference]: Finished difference Result 196 states and 263 transitions. [2022-07-19 15:52:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 15:52:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 109 [2022-07-19 15:52:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:52:31,412 INFO L225 Difference]: With dead ends: 196 [2022-07-19 15:52:31,412 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 15:52:31,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=399, Invalid=1672, Unknown=11, NotChecked=270, Total=2352 [2022-07-19 15:52:31,414 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 170 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 65.8s IncrementalHoareTripleChecker+Time [2022-07-19 15:52:31,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 315 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 942 Invalid, 27 Unknown, 9 Unchecked, 65.8s Time] [2022-07-19 15:52:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 15:52:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-19 15:52:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 97 states have (on average 1.134020618556701) internal successors, (110), 98 states have internal predecessors, (110), 67 states have call successors, (67), 15 states have call predecessors, (67), 15 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-19 15:52:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 243 transitions. [2022-07-19 15:52:31,461 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 243 transitions. Word has length 109 [2022-07-19 15:52:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:52:31,462 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 243 transitions. [2022-07-19 15:52:31,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-19 15:52:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 243 transitions. [2022-07-19 15:52:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 15:52:31,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:52:31,464 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:52:31,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 15:52:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 15:52:31,679 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:52:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:52:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1760442774, now seen corresponding path program 3 times [2022-07-19 15:52:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:52:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061617789] [2022-07-19 15:52:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:52:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:52:31,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:52:31,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335733894] [2022-07-19 15:52:31,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:52:31,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:52:31,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:52:31,697 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:52:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 15:52:31,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:52:31,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:52:31,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:52:31,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:52:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-07-19 15:52:31,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:52:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-07-19 15:52:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:52:31,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061617789] [2022-07-19 15:52:31,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:52:31,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335733894] [2022-07-19 15:52:31,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335733894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:52:31,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:52:31,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-19 15:52:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544076155] [2022-07-19 15:52:31,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:52:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:52:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:52:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:52:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:52:31,861 INFO L87 Difference]: Start difference. First operand 180 states and 243 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 15:52:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:52:32,116 INFO L93 Difference]: Finished difference Result 225 states and 312 transitions. [2022-07-19 15:52:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:52:32,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 112 [2022-07-19 15:52:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:52:32,118 INFO L225 Difference]: With dead ends: 225 [2022-07-19 15:52:32,118 INFO L226 Difference]: Without dead ends: 218 [2022-07-19 15:52:32,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-19 15:52:32,119 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:52:32,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 253 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:52:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-19 15:52:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2022-07-19 15:52:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 100 states have internal predecessors, (113), 71 states have call successors, (71), 15 states have call predecessors, (71), 15 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-07-19 15:52:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 254 transitions. [2022-07-19 15:52:32,168 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 254 transitions. Word has length 112 [2022-07-19 15:52:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:52:32,168 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 254 transitions. [2022-07-19 15:52:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 15:52:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 254 transitions. [2022-07-19 15:52:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 15:52:32,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:52:32,170 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:52:32,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 15:52:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:52:32,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:52:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:52:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1098112047, now seen corresponding path program 2 times [2022-07-19 15:52:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:52:32,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23976415] [2022-07-19 15:52:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:52:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:52:32,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:52:32,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023741909] [2022-07-19 15:52:32,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:52:32,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:52:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:52:32,397 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:52:32,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 15:52:32,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:52:32,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:52:32,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 15:52:32,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:52:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 123 proven. 50 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-19 15:52:33,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:52:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 127 proven. 32 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-07-19 15:52:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:52:49,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23976415] [2022-07-19 15:52:49,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:52:49,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023741909] [2022-07-19 15:52:49,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023741909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:52:49,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:52:49,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-19 15:52:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795053698] [2022-07-19 15:52:49,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:52:49,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 15:52:49,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:52:49,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 15:52:49,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-07-19 15:52:49,172 INFO L87 Difference]: Start difference. First operand 186 states and 254 transitions. Second operand has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 11 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 12 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-19 15:52:52,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:52:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:52:55,864 INFO L93 Difference]: Finished difference Result 220 states and 296 transitions. [2022-07-19 15:52:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 15:52:55,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 11 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 12 states have call predecessors, (32), 10 states have call successors, (32) Word has length 125 [2022-07-19 15:52:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:52:55,866 INFO L225 Difference]: With dead ends: 220 [2022-07-19 15:52:55,866 INFO L226 Difference]: Without dead ends: 216 [2022-07-19 15:52:55,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 225 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2022-07-19 15:52:55,867 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:52:55,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 243 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 709 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-19 15:52:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-19 15:52:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2022-07-19 15:52:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 79 states have call successors, (79), 18 states have call predecessors, (79), 17 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-07-19 15:52:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-19 15:52:55,917 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 125 [2022-07-19 15:52:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:52:55,917 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-19 15:52:55,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 11 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 12 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-19 15:52:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-19 15:52:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 15:52:55,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:52:55,919 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:52:55,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 15:52:56,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 15:52:56,130 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:52:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:52:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2018058068, now seen corresponding path program 4 times [2022-07-19 15:52:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:52:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384968963] [2022-07-19 15:52:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:52:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:52:56,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:52:56,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966007484] [2022-07-19 15:52:56,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 15:52:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:52:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:52:56,161 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:52:56,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 15:52:56,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 15:52:56,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:52:56,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-19 15:52:56,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:52:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 151 proven. 124 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2022-07-19 15:52:58,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:53:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 180 proven. 63 refuted. 12 times theorem prover too weak. 672 trivial. 0 not checked. [2022-07-19 15:53:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:53:12,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384968963] [2022-07-19 15:53:12,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:53:12,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966007484] [2022-07-19 15:53:12,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966007484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:53:12,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:53:12,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2022-07-19 15:53:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257478769] [2022-07-19 15:53:12,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:53:12,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 15:53:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:53:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 15:53:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=717, Unknown=5, NotChecked=0, Total=870 [2022-07-19 15:53:12,390 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 24 states have internal predecessors, (55), 17 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-07-19 15:53:15,980 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)))) (let ((.cse3 (not (= .cse0 |c_ULTIMATE.start_main_~b~0#1|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse5 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (or (not (= |c_ULTIMATE.start_main_~b~0#1| 0)) (= .cse0 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse5))) (let ((.cse1 (div .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse1) (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse1 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse1 |c_ULTIMATE.start_main_~q~0#1|))) .cse3 (not (= (mod .cse4 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (or (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (<= 1 |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1| .cse5 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (div .cse7 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse6 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse3 (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse6 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse6 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse6 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse7 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse6 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1| .cse5 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse8 (div .cse9 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse8) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse8 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse3 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse8 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse8 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse8 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse9 |c_ULTIMATE.start_main_~b~0#1|) 0)))))))) is different from true [2022-07-19 15:53:18,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)))) (let ((.cse3 (not (= .cse0 |c_ULTIMATE.start_main_~b~0#1|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse5 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (or (not (= |c_ULTIMATE.start_main_~b~0#1| 0)) (= .cse0 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse5))) (let ((.cse1 (div .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse1) (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse1 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse1 |c_ULTIMATE.start_main_~q~0#1|))) .cse3 (not (= (mod .cse4 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1| .cse5 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (div .cse7 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse6 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse3 (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse6 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse6 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse6 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse7 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse6 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (or (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) .cse3 (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~k~0#1|)) |c_ULTIMATE.start_main_~a~0#1|)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1| .cse5 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse8 (div .cse9 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse8) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse8 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse3 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse8 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse8 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse8 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse9 |c_ULTIMATE.start_main_~b~0#1|) 0)))))))) is different from false [2022-07-19 15:53:21,713 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse4))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse0) (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) .cse2 (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (div .cse6 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse5 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse2 (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse5 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse5 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse5 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse6 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse5 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse7 (div .cse8 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse7) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse7 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse2 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse7 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse7 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse7 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse8 |c_ULTIMATE.start_main_~b~0#1|) 0))))))) is different from true [2022-07-19 15:53:23,719 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse0 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse1 (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse0 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (or (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) .cse1 (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~k~0#1|)) |c_ULTIMATE.start_main_~a~0#1|)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse5 (div .cse6 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse5) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse5 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse1 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse5 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse5 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse5 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse6 |c_ULTIMATE.start_main_~b~0#1|) 0))))))) is different from true [2022-07-19 15:53:25,727 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))) (.cse0 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (or (= .cse0 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) .cse1 (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse2 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse2 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse1 (= .cse0 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse2 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse2 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse2 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse2 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse5 (div .cse6 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse5) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse5 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse1 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse5 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse0 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse5 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse5 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse6 |c_ULTIMATE.start_main_~b~0#1|) 0))))))) is different from true [2022-07-19 15:53:27,762 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse4))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse0) (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) .cse2 (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (or (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) .cse2 (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (div .cse6 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse5 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse2 (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse5 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse5 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse5 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse6 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse5 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse7 (div .cse8 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse7) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse7 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse2 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse7 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse7 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse7 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse8 |c_ULTIMATE.start_main_~b~0#1|) 0))))))) is different from true [2022-07-19 15:53:29,805 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse4))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse0) (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) .cse2 (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (or (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (div .cse6 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse5 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse2 (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse5 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse5 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse5 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse6 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse5 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse7 (div .cse8 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse7) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse7 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse2 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse7 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse7 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse7 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse8 |c_ULTIMATE.start_main_~b~0#1|) 0))))))) is different from true [2022-07-19 15:53:31,912 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|)))) (let ((.cse3 (not (= .cse0 |c_ULTIMATE.start_main_~b~0#1|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse5 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (or (not (= |c_ULTIMATE.start_main_~b~0#1| 0)) (= .cse0 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse5))) (let ((.cse1 (div .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse1) (= .cse2 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse1 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse1 |c_ULTIMATE.start_main_~q~0#1|))) .cse3 (not (= (mod .cse4 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse1 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (or (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1| .cse5 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse6 (div .cse7 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse6) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse6 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse3 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse6 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse2 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse6 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse6 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse7 |c_ULTIMATE.start_main_~b~0#1|) 0)))))))) is different from true [2022-07-19 15:53:34,235 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~y~0#1| .cse10)) (.cse2 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) .cse10) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse4))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse0) (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) .cse2 (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (< .cse5 |c_ULTIMATE.start_main_~x~0#1|) (or (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1| 1) (<= 0 .cse5) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (div .cse7 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse6 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse2 (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse6 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse6 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse6 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse7 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse6 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (= (* |c_ULTIMATE.start_main_~x~0#1| (* (- 1) |c_ULTIMATE.start_main_~q~0#1|)) (* |c_ULTIMATE.start_main_~x~0#1| 3)) (= .cse5 |c_ULTIMATE.start_main_~b~0#1|) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse8 (div .cse9 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse8) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse8 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse2 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse8 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse8 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse8 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse9 |c_ULTIMATE.start_main_~b~0#1|) 0)))))))) is different from true [2022-07-19 15:53:39,063 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~q~0#1|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~y~0#1| .cse10)) (.cse2 (not (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1|) .cse10) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~r~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1| (* 3 |c_ULTIMATE.start_main_~b~0#1|) .cse4))) (let ((.cse0 (div .cse3 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (+ (* (- 1) .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|) 0)) (< (+ 3 |c_ULTIMATE.start_main_~k~0#1|) .cse0) (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse0 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse0 |c_ULTIMATE.start_main_~q~0#1|))) .cse2 (not (= (mod .cse3 |c_ULTIMATE.start_main_~b~0#1|) 0)) (<= (+ (* .cse0 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))) (< .cse5 |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_~s~0#1| 1) (<= 0 .cse5) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (div .cse7 |c_ULTIMATE.start_main_~b~0#1|))) (or (not (<= .cse6 (+ |c_ULTIMATE.start_main_~k~0#1| 1))) .cse2 (= .cse1 (+ (* |c_ULTIMATE.start_main_~y~0#1| .cse6 |c_ULTIMATE.start_main_~s~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| .cse6 |c_ULTIMATE.start_main_~q~0#1|))) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse6 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod .cse7 |c_ULTIMATE.start_main_~b~0#1|) 0)) (not (= 0 (+ (* (- 1) .cse6 |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~a~0#1|)))))) (or (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~s~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (not (= |c_ULTIMATE.start_main_~c~0#1| 0)) .cse2 (not (= (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~k~0#1|)) |c_ULTIMATE.start_main_~a~0#1|)) (<= |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~c~0#1|)) (= (* |c_ULTIMATE.start_main_~x~0#1| (* (- 1) |c_ULTIMATE.start_main_~q~0#1|)) (* |c_ULTIMATE.start_main_~x~0#1| 3)) (= .cse5 |c_ULTIMATE.start_main_~b~0#1|) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1| .cse4 (* 2 |c_ULTIMATE.start_main_~b~0#1|)))) (let ((.cse8 (div .cse9 |c_ULTIMATE.start_main_~b~0#1|))) (or (< (+ 2 |c_ULTIMATE.start_main_~k~0#1|) .cse8) (<= (+ |c_ULTIMATE.start_main_~b~0#1| (* .cse8 |c_ULTIMATE.start_main_~b~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) .cse2 (not (= (+ |c_ULTIMATE.start_main_~a~0#1| (* (- 1) .cse8 |c_ULTIMATE.start_main_~b~0#1|)) 0)) (= .cse1 (+ (* |c_ULTIMATE.start_main_~x~0#1| .cse8 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| .cse8 |c_ULTIMATE.start_main_~s~0#1|))) (not (= (mod .cse9 |c_ULTIMATE.start_main_~b~0#1|) 0)))))))) is different from true [2022-07-19 15:53:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:53:39,159 INFO L93 Difference]: Finished difference Result 242 states and 324 transitions. [2022-07-19 15:53:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 15:53:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 24 states have internal predecessors, (55), 17 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) Word has length 156 [2022-07-19 15:53:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:53:39,160 INFO L225 Difference]: With dead ends: 242 [2022-07-19 15:53:39,160 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 15:53:39,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=308, Invalid=1439, Unknown=15, NotChecked=890, Total=2652 [2022-07-19 15:53:39,162 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 109 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-19 15:53:39,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 299 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1411 Invalid, 0 Unknown, 118 Unchecked, 4.6s Time] [2022-07-19 15:53:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 15:53:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 15:53:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:53:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 15:53:39,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2022-07-19 15:53:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:53:39,164 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 15:53:39,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 24 states have internal predecessors, (55), 17 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-07-19 15:53:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 15:53:39,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 15:53:39,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:53:39,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 15:53:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 15:53:39,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.