./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP --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 b7c0c1846e9a6fbcad5ffdf5765d9507f8f71f41aa86cc236ddeb4027e19a311 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:58,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:58,402 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:58,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:58,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:58,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:58,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:58,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:58,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:58,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:58,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:58,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:58,479 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:58,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:58,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:58,482 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:58,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:58,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:58,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:58,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:58,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:58,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:58,488 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:58,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:58,489 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:58,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:58,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:58,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:58,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:58,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:58,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:58,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:58,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:58,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:58,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:58,496 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:58,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:58,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:58,497 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:58,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP 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 -> b7c0c1846e9a6fbcad5ffdf5765d9507f8f71f41aa86cc236ddeb4027e19a311 [2023-11-06 22:25:58,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:58,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:58,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:58,918 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:58,918 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:58,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i [2023-11-06 22:26:02,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:26:02,263 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:26:02,264 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i [2023-11-06 22:26:02,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/data/8689c5534/f2ff1a19ccee450ca6577834a7dc698c/FLAG821158ce8 [2023-11-06 22:26:02,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/data/8689c5534/f2ff1a19ccee450ca6577834a7dc698c [2023-11-06 22:26:02,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:26:02,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:26:02,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:02,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:26:02,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:26:02,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56536e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02, skipping insertion in model container [2023-11-06 22:26:02,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,332 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:26:02,523 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i[915,928] [2023-11-06 22:26:02,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:02,560 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:26:02,574 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i[915,928] [2023-11-06 22:26:02,586 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:02,603 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:26:02,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02 WrapperNode [2023-11-06 22:26:02,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:02,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:02,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:26:02,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:26:02,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,666 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-11-06 22:26:02,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:02,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:26:02,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:26:02,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:26:02,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:26:02,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:26:02,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:26:02,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:26:02,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:02,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:26:02,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:26:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:26:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:26:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:26:02,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:26:02,838 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:26:02,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:26:03,037 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:26:03,044 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:26:03,045 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:26:03,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:03 BoogieIcfgContainer [2023-11-06 22:26:03,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:26:03,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:26:03,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:26:03,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:26:03,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:02" (1/3) ... [2023-11-06 22:26:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d20fbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:03, skipping insertion in model container [2023-11-06 22:26:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02" (2/3) ... [2023-11-06 22:26:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d20fbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:03, skipping insertion in model container [2023-11-06 22:26:03,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:03" (3/3) ... [2023-11-06 22:26:03,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-44.i [2023-11-06 22:26:03,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:26:03,088 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:26:03,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:26:03,195 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@412db32, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:26:03,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:26:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:26:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:26:03,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,219 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:03,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1117978249, now seen corresponding path program 1 times [2023-11-06 22:26:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576425756] [2023-11-06 22:26:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:26:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:26:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:26:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:26:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:26:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:26:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:26:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:26:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:26:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576425756] [2023-11-06 22:26:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576425756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:03,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:26:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101366282] [2023-11-06 22:26:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:03,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:26:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:26:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:26:03,644 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:26:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:03,672 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2023-11-06 22:26:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:26:03,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2023-11-06 22:26:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:03,683 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:26:03,684 INFO L226 Difference]: Without dead ends: 38 [2023-11-06 22:26:03,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:26:03,692 INFO L413 NwaCegarLoop]: 53 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, 53 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 [2023-11-06 22:26:03,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-06 22:26:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-06 22:26:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:26:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-11-06 22:26:03,737 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 87 [2023-11-06 22:26:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:03,737 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-11-06 22:26:03,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:26:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-11-06 22:26:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:26:03,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,743 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:03,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:26:03,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1001633097, now seen corresponding path program 1 times [2023-11-06 22:26:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987836652] [2023-11-06 22:26:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:26:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:26:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:26:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:26:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:26:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:26:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:26:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:26:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:26:05,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987836652] [2023-11-06 22:26:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987836652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:26:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210090328] [2023-11-06 22:26:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:05,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:05,693 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:26:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:06,171 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2023-11-06 22:26:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:26:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-11-06 22:26:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:06,179 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:26:06,180 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:26:06,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:06,190 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 22 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:06,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 298 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:26:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2023-11-06 22:26:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:26:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2023-11-06 22:26:06,228 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 87 [2023-11-06 22:26:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:06,231 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2023-11-06 22:26:06,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:26:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2023-11-06 22:26:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:26:06,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:06,244 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:06,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:26:06,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:06,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash -932353188, now seen corresponding path program 1 times [2023-11-06 22:26:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784632805] [2023-11-06 22:26:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:26:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:26:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:26:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:26:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:26:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:26:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:26:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:26:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:26:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784632805] [2023-11-06 22:26:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784632805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:07,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:26:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575615448] [2023-11-06 22:26:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:26:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:26:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:26:07,256 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:26:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:07,781 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2023-11-06 22:26:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:26:07,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2023-11-06 22:26:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:07,782 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:26:07,783 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:26:07,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:26:07,785 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 31 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:07,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 346 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:26:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:26:07,787 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) [2023-11-06 22:26:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:26:07,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2023-11-06 22:26:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:07,788 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:26:07,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:26:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:26:07,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:26:07,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:26:07,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:26:07,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:26:08,293 INFO L899 garLoopResultBuilder]: For program point L64(lines 43 65) no Hoare annotation was computed. [2023-11-06 22:26:08,294 INFO L902 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: true [2023-11-06 22:26:08,294 INFO L902 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: true [2023-11-06 22:26:08,294 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 22:26:08,294 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:26:08,294 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:26:08,295 INFO L902 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2023-11-06 22:26:08,295 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse8 (= ~var_1_1~0 ~var_1_6~0)) (.cse9 (+ ~var_1_2~0 1)) (.cse4 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse5 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)))) (or (let ((.cse2 (or .cse8 (< ~var_1_3~0 .cse9))) (.cse1 (+ ~var_1_4~0 ~var_1_5~0))) (and (or (< ~var_1_6~0 (+ ~var_1_4~0 ~var_1_5~0 1)) (let ((.cse0 (* 256 (div .cse1 256)))) (let ((.cse3 (= .cse1 (+ 256 ~var_1_1~0 .cse0)))) (and (or (and (< (+ 127 .cse0) .cse1) .cse2) (not .cse3)) (or (and (< .cse1 (+ 128 .cse0)) .cse2 (= .cse1 (+ ~var_1_1~0 .cse0))) .cse3))))) .cse4 .cse5 (or (let ((.cse6 (* 256 (div ~var_1_6~0 256)))) (let ((.cse7 (= (+ 256 .cse6 ~var_1_1~0) ~var_1_6~0))) (and (or (and .cse2 (< (+ .cse6 127) ~var_1_6~0)) (not .cse7)) (or (and .cse2 (< ~var_1_6~0 (+ .cse6 128)) (= (+ .cse6 ~var_1_1~0) ~var_1_6~0)) .cse7)))) (< .cse1 ~var_1_6~0)))) (and .cse8 (<= .cse9 ~var_1_3~0) .cse4 .cse5))) [2023-11-06 22:26:08,295 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2023-11-06 22:26:08,295 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 72 83) the Hoare annotation is: false [2023-11-06 22:26:08,296 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-06 22:26:08,296 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 32 42) no Hoare annotation was computed. [2023-11-06 22:26:08,296 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:26:08,296 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 22:26:08,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:26:08,296 INFO L902 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: true [2023-11-06 22:26:08,296 INFO L902 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: true [2023-11-06 22:26:08,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:26:08,297 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 22:26:08,297 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 68 71) the Hoare annotation is: (let ((.cse2 (+ ~var_1_4~0 ~var_1_5~0)) (.cse1 (or (= ~var_1_1~0 ~var_1_6~0) (< ~var_1_3~0 (+ ~var_1_2~0 1)))) (.cse4 (< ~var_1_2~0 ~var_1_3~0))) (and (or (< ~var_1_6~0 (+ ~var_1_4~0 ~var_1_5~0 1)) (let ((.cse3 (* 256 (div .cse2 256)))) (let ((.cse0 (= .cse2 (+ 256 ~var_1_1~0 .cse3)))) (and (or .cse0 (and .cse1 (or (= .cse2 (+ ~var_1_1~0 .cse3)) .cse4) (or (< .cse2 (+ 128 .cse3)) .cse4))) (or (and (or (< (+ 127 .cse3) .cse2) .cse4) .cse1) (not .cse0)))))) (not (= |ULTIMATE.start_property_#res#1| 0)) (or (< .cse2 ~var_1_6~0) (let ((.cse6 (* 256 (div ~var_1_6~0 256)))) (let ((.cse5 (= (+ 256 .cse6 ~var_1_1~0) ~var_1_6~0))) (and (or .cse5 (and (or (< ~var_1_6~0 (+ .cse6 128)) .cse4) .cse1 (or (= (+ .cse6 ~var_1_1~0) ~var_1_6~0) .cse4))) (or (and .cse1 (or (< (+ .cse6 127) ~var_1_6~0) .cse4)) (not .cse5)))))))) [2023-11-06 22:26:08,297 INFO L902 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2023-11-06 22:26:08,297 INFO L902 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: true [2023-11-06 22:26:08,298 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 67) no Hoare annotation was computed. [2023-11-06 22:26:08,298 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-11-06 22:26:08,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:26:08,298 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-06 22:26:08,298 INFO L902 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: true [2023-11-06 22:26:08,299 INFO L902 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: true [2023-11-06 22:26:08,299 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-11-06 22:26:08,299 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:26:08,300 INFO L895 garLoopResultBuilder]: At program point L75-2(lines 75 81) the Hoare annotation is: (or (let ((.cse0 (+ ~var_1_4~0 ~var_1_5~0))) (and (or (< ~var_1_6~0 (+ ~var_1_4~0 ~var_1_5~0 1)) (let ((.cse1 (* 256 (div .cse0 256)))) (let ((.cse2 (+ 127 .cse1)) (.cse3 (= .cse0 (+ 256 ~var_1_1~0 .cse1)))) (and (or (and (= .cse0 (+ ~var_1_1~0 .cse1)) (<= .cse0 .cse2)) .cse3) (or (< .cse2 .cse0) (not .cse3)))))) (not (= |ULTIMATE.start_property_#res#1| 0)) (or (let ((.cse5 (* 256 (div ~var_1_6~0 256)))) (let ((.cse4 (= (+ 256 .cse5 ~var_1_1~0) ~var_1_6~0)) (.cse6 (+ .cse5 127))) (and (or .cse4 (and (= (+ .cse5 ~var_1_1~0) ~var_1_6~0) (<= ~var_1_6~0 .cse6))) (or (not .cse4) (< .cse6 ~var_1_6~0))))) (< .cse0 ~var_1_6~0)))) (< ~var_1_2~0 ~var_1_3~0)) [2023-11-06 22:26:08,300 INFO L899 garLoopResultBuilder]: For program point L75-3(lines 75 81) no Hoare annotation was computed. [2023-11-06 22:26:08,300 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2023-11-06 22:26:08,300 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-06 22:26:08,301 INFO L902 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: true [2023-11-06 22:26:08,301 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-06 22:26:08,301 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-06 22:26:08,301 INFO L902 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: true [2023-11-06 22:26:08,301 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:26:08,302 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:26:08,302 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:26:08,302 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:26:08,305 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:26:08,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:26:08,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:08 BoogieIcfgContainer [2023-11-06 22:26:08,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:26:08,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:26:08,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:26:08,350 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:26:08,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:03" (3/4) ... [2023-11-06 22:26:08,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:26:08,361 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:26:08,369 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:26:08,370 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:26:08,370 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:26:08,370 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:26:08,401 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_4 + var_1_5) <= (127 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))) && (((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && ((((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) && (var_1_6 <= ((256 * (var_1_6 / 256)) + 127)))) && (!((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)) || (((256 * (var_1_6 / 256)) + 127) < var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || (var_1_2 < var_1_3)) [2023-11-06 22:26:08,404 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || ((((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))) || ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3))) && (((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3)))) && (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && (((var_1_4 + var_1_5) < var_1_6) || (((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((var_1_6 < ((256 * (var_1_6 / 256)) + 128)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) || (var_1_2 < var_1_3)))) && ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && ((((256 * (var_1_6 / 256)) + 127) < var_1_6) || (var_1_2 < var_1_3))) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)))))) [2023-11-06 22:26:08,404 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))) && (((((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))))) && !((\result == 0))) && !((cond == 0))) && ((((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((256 * (var_1_6 / 256)) + 127) < var_1_6)) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) && (((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (var_1_6 < ((256 * (var_1_6 / 256)) + 128))) && (((256 * (var_1_6 / 256)) + var_1_1) == var_1_6)) || (((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || ((((var_1_1 == var_1_6) && ((var_1_2 + 1) <= var_1_3)) && !((\result == 0))) && !((cond == 0)))) [2023-11-06 22:26:08,432 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_4 + var_1_5) <= (127 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))) && (((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && ((((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) && (var_1_6 <= ((256 * (var_1_6 / 256)) + 127)))) && (!((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)) || (((256 * (var_1_6 / 256)) + 127) < var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || (var_1_2 < var_1_3)) [2023-11-06 22:26:08,435 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || ((((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))) || ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3))) && (((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3)))) && (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && (((var_1_4 + var_1_5) < var_1_6) || (((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((var_1_6 < ((256 * (var_1_6 / 256)) + 128)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) || (var_1_2 < var_1_3)))) && ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && ((((256 * (var_1_6 / 256)) + 127) < var_1_6) || (var_1_2 < var_1_3))) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)))))) [2023-11-06 22:26:08,435 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))) && (((((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))))) && !((\result == 0))) && !((cond == 0))) && ((((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((256 * (var_1_6 / 256)) + 127) < var_1_6)) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) && (((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (var_1_6 < ((256 * (var_1_6 / 256)) + 128))) && (((256 * (var_1_6 / 256)) + var_1_1) == var_1_6)) || (((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || ((((var_1_1 == var_1_6) && ((var_1_2 + 1) <= var_1_3)) && !((\result == 0))) && !((cond == 0)))) [2023-11-06 22:26:08,445 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:26:08,445 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:26:08,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:26:08,446 INFO L158 Benchmark]: Toolchain (without parser) took 6147.94ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.7MB in the beginning and 110.6MB in the end (delta: 19.1MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,446 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 115.3MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:26:08,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.20ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 118.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.92ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 116.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,447 INFO L158 Benchmark]: Boogie Preprocessor took 24.12ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.8MB in the end (delta: 765.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,448 INFO L158 Benchmark]: RCFGBuilder took 353.73ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,448 INFO L158 Benchmark]: TraceAbstraction took 5296.29ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 102.6MB in the beginning and 114.8MB in the end (delta: -12.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,448 INFO L158 Benchmark]: Witness Printer took 95.50ms. Allocated memory is still 195.0MB. Free memory was 114.8MB in the beginning and 110.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:26:08,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 115.3MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.20ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 118.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.92ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 116.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.12ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.8MB in the end (delta: 765.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.73ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5296.29ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 102.6MB in the beginning and 114.8MB in the end (delta: -12.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 95.50ms. Allocated memory is still 195.0MB. Free memory was 114.8MB in the beginning and 110.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 697 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 232 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 60 PreInvPairs, 95 NumberOfFragments, 568 HoareAnnotationTreeSize, 60 FomulaSimplifications, 503 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || ((((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))) || ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3))) && (((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) || (var_1_2 < var_1_3)))) && (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && (((var_1_4 + var_1_5) < var_1_6) || (((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((var_1_6 < ((256 * (var_1_6 / 256)) + 128)) || (var_1_2 < var_1_3)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) || (var_1_2 < var_1_3)))) && ((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && ((((256 * (var_1_6 / 256)) + 127) < var_1_6) || (var_1_2 < var_1_3))) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)))))) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_4 + var_1_5) <= (127 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))) && (((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))))) && !((\result == 0))) && ((((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6) || ((((256 * (var_1_6 / 256)) + var_1_1) == var_1_6) && (var_1_6 <= ((256 * (var_1_6 / 256)) + 127)))) && (!((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6)) || (((256 * (var_1_6 / 256)) + 127) < var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || (var_1_2 < var_1_3)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((var_1_6 < ((var_1_4 + var_1_5) + 1)) || (((((127 + (256 * ((var_1_4 + var_1_5) / 256))) < (var_1_4 + var_1_5)) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) || !(((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256)))))) && (((((var_1_4 + var_1_5) < (128 + (256 * ((var_1_4 + var_1_5) / 256)))) && ((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1)))) && ((var_1_4 + var_1_5) == (var_1_1 + (256 * ((var_1_4 + var_1_5) / 256))))) || ((var_1_4 + var_1_5) == ((256 + var_1_1) + (256 * ((var_1_4 + var_1_5) / 256))))))) && !((\result == 0))) && !((cond == 0))) && ((((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (((256 * (var_1_6 / 256)) + 127) < var_1_6)) || !((((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) && (((((var_1_1 == var_1_6) || (var_1_3 < (var_1_2 + 1))) && (var_1_6 < ((256 * (var_1_6 / 256)) + 128))) && (((256 * (var_1_6 / 256)) + var_1_1) == var_1_6)) || (((256 + (256 * (var_1_6 / 256))) + var_1_1) == var_1_6))) || ((var_1_4 + var_1_5) < var_1_6))) || ((((var_1_1 == var_1_6) && ((var_1_2 + 1) <= var_1_3)) && !((\result == 0))) && !((cond == 0)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:26:08,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1fc5595-2f5d-4065-b431-9f000df9bd75/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE