./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:17,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:17,631 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:59:17,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:17,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:17,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:17,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:17,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:17,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:59:17,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:59:17,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:17,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:17,696 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:17,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:17,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:59:17,699 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:17,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:59:17,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:17,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:17,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:59:17,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:59:17,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:59:17,702 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:17,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:59:17,703 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:17,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:17,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:17,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:59:17,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:17,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:17,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:59:17,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:59:17,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:59:17,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:59:17,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:59:17,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:59:17,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:59:17,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:59:17,714 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:59:17,714 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_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/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_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 [2023-11-19 07:59:18,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:18,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:18,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:18,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:18,030 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:18,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-19 07:59:21,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:21,515 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:21,516 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-19 07:59:21,529 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/data/b3af9f371/9c3e4b33971344ce8d87acf2bfbaf2a5/FLAGca88a8099 [2023-11-19 07:59:21,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/data/b3af9f371/9c3e4b33971344ce8d87acf2bfbaf2a5 [2023-11-19 07:59:21,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:21,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:21,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:21,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:21,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:21,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:21,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9a425f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21, skipping insertion in model container [2023-11-19 07:59:21,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:21,614 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:21,807 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_b26a7846-3904-484f-b139-6b1079a3d935/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-19 07:59:21,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:21,868 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:21,882 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_b26a7846-3904-484f-b139-6b1079a3d935/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-19 07:59:21,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:21,926 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:21,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21 WrapperNode [2023-11-19 07:59:21,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:21,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:21,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:21,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:21,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:21,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,005 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-19 07:59:22,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:22,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:22,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:22,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:22,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:22,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:22,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:22,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:22,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (1/1) ... [2023-11-19 07:59:22,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:22,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:22,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:59:22,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:59:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:59:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:22,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:22,253 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:22,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:22,607 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:22,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:22,627 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:59:22,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:22 BoogieIcfgContainer [2023-11-19 07:59:22,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:22,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:59:22,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:59:22,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:59:22,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:59:21" (1/3) ... [2023-11-19 07:59:22,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f6090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:22, skipping insertion in model container [2023-11-19 07:59:22,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:21" (2/3) ... [2023-11-19 07:59:22,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f6090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:22, skipping insertion in model container [2023-11-19 07:59:22,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:22" (3/3) ... [2023-11-19 07:59:22,648 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-19 07:59:22,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:59:22,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:59:22,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:22,742 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=LoopHeads, 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;@13c7fba1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:22,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:59:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:59:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-19 07:59:22,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:22,765 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1] [2023-11-19 07:59:22,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:22,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 400622614, now seen corresponding path program 1 times [2023-11-19 07:59:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543913618] [2023-11-19 07:59:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:59:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:59:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:59:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:59:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-19 07:59:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543913618] [2023-11-19 07:59:25,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543913618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:25,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:59:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791253851] [2023-11-19 07:59:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:59:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:59:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:59:26,041 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:59:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:26,745 INFO L93 Difference]: Finished difference Result 172 states and 287 transitions. [2023-11-19 07:59:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:26,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2023-11-19 07:59:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:26,762 INFO L225 Difference]: With dead ends: 172 [2023-11-19 07:59:26,762 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 07:59:26,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:59:26,773 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:26,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 290 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:59:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 07:59:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2023-11-19 07:59:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-19 07:59:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2023-11-19 07:59:26,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 87 [2023-11-19 07:59:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:26,882 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2023-11-19 07:59:26,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:59:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2023-11-19 07:59:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 07:59:26,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:26,889 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1] [2023-11-19 07:59:26,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:59:26,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:26,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1313057984, now seen corresponding path program 1 times [2023-11-19 07:59:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040091415] [2023-11-19 07:59:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:59:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:59:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:59:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:59:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-19 07:59:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040091415] [2023-11-19 07:59:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040091415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190151464] [2023-11-19 07:59:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:27,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:27,138 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:27,313 INFO L93 Difference]: Finished difference Result 211 states and 294 transitions. [2023-11-19 07:59:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-19 07:59:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:27,317 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:59:27,317 INFO L226 Difference]: Without dead ends: 131 [2023-11-19 07:59:27,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:27,320 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:27,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 173 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:59:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-19 07:59:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2023-11-19 07:59:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 78 states have internal predecessors, (92), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-19 07:59:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2023-11-19 07:59:27,419 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 88 [2023-11-19 07:59:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:27,421 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2023-11-19 07:59:27,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2023-11-19 07:59:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 07:59:27,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:27,427 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1] [2023-11-19 07:59:27,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:59:27,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:27,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash 764583191, now seen corresponding path program 1 times [2023-11-19 07:59:27,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:27,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065618061] [2023-11-19 07:59:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:27,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:59:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:59:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:59:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:59:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-19 07:59:28,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065618061] [2023-11-19 07:59:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065618061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:59:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206150640] [2023-11-19 07:59:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:59:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:59:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:59:28,822 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:29,815 INFO L93 Difference]: Finished difference Result 234 states and 330 transitions. [2023-11-19 07:59:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:59:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-19 07:59:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:29,826 INFO L225 Difference]: With dead ends: 234 [2023-11-19 07:59:29,826 INFO L226 Difference]: Without dead ends: 232 [2023-11-19 07:59:29,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:59:29,834 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:29,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 378 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:59:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-19 07:59:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 137. [2023-11-19 07:59:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.202127659574468) internal successors, (113), 94 states have internal predecessors, (113), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-19 07:59:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2023-11-19 07:59:29,926 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 88 [2023-11-19 07:59:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:29,929 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2023-11-19 07:59:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2023-11-19 07:59:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 07:59:29,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:29,933 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1] [2023-11-19 07:59:29,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:59:29,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:29,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 766430233, now seen corresponding path program 1 times [2023-11-19 07:59:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139596357] [2023-11-19 07:59:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:59:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:59:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:59:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:59:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-19 07:59:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139596357] [2023-11-19 07:59:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139596357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:31,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:59:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485860289] [2023-11-19 07:59:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:59:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:59:31,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:59:31,893 INFO L87 Difference]: Start difference. First operand 137 states and 191 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:33,438 INFO L93 Difference]: Finished difference Result 255 states and 365 transitions. [2023-11-19 07:59:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:59:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-19 07:59:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:33,442 INFO L225 Difference]: With dead ends: 255 [2023-11-19 07:59:33,442 INFO L226 Difference]: Without dead ends: 253 [2023-11-19 07:59:33,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:59:33,444 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 45 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:33,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 468 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:59:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-19 07:59:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2023-11-19 07:59:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.1914893617021276) internal successors, (112), 94 states have internal predecessors, (112), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-19 07:59:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2023-11-19 07:59:33,510 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 88 [2023-11-19 07:59:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:33,511 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2023-11-19 07:59:33,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:59:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2023-11-19 07:59:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-19 07:59:33,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:33,514 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:33,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:59:33,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:33,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 106134182, now seen corresponding path program 1 times [2023-11-19 07:59:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154364260] [2023-11-19 07:59:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:59:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:59:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:59:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:59:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:59:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-19 07:59:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-19 07:59:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-19 07:59:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-19 07:59:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-19 07:59:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-19 07:59:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-19 07:59:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-19 07:59:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-19 07:59:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-19 07:59:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-19 07:59:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-19 07:59:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-19 07:59:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154364260] [2023-11-19 07:59:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154364260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84012302] [2023-11-19 07:59:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:33,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:33,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:33,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:59:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:59:33,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-11-19 07:59:34,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84012302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:59:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-19 07:59:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079486819] [2023-11-19 07:59:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:34,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:34,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:34,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:34,090 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-19 07:59:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:34,157 INFO L93 Difference]: Finished difference Result 182 states and 249 transitions. [2023-11-19 07:59:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2023-11-19 07:59:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:34,158 INFO L225 Difference]: With dead ends: 182 [2023-11-19 07:59:34,159 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:59:34,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:34,164 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:34,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:59:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:59:34,169 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-19 07:59:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:59:34,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2023-11-19 07:59:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:34,170 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:59:34,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-19 07:59:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:59:34,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:59:34,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:59:34,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:34,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:34,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:59:36,215 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-11-19 07:59:36,215 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 07:59:36,215 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 07:59:36,215 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-11-19 07:59:36,215 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 07:59:36,216 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,217 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,221 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 91 103) no Hoare annotation was computed. [2023-11-19 07:59:36,222 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-19 07:59:36,222 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-19 07:59:36,222 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,223 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-11-19 07:59:36,223 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-19 07:59:36,223 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,223 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-19 07:59:36,224 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:59:36,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:59:36,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 07:59:36,224 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-19 07:59:36,224 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 87 90) no Hoare annotation was computed. [2023-11-19 07:59:36,225 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,225 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,225 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-19 07:59:36,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:59:36,226 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,226 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,226 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 95 101) no Hoare annotation was computed. [2023-11-19 07:59:36,229 INFO L895 garLoopResultBuilder]: At program point L95-3(lines 95 101) the Hoare annotation is: (let ((.cse5 (div ~var_1_14~0 256))) (let ((.cse4 (* 256 .cse5))) (let ((.cse0 (or (< (+ .cse4 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse5)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0))) (.cse1 (or (not (= (+ .cse4 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128))) (.cse2 (<= .cse5 0)) (.cse3 (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse4))))) (or (and .cse0 (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 .cse3))))) [2023-11-19 07:59:36,229 INFO L899 garLoopResultBuilder]: For program point L95-4(lines 95 101) no Hoare annotation was computed. [2023-11-19 07:59:36,229 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 86) no Hoare annotation was computed. [2023-11-19 07:59:36,229 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-19 07:59:36,230 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-11-19 07:59:36,230 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-19 07:59:36,230 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:59:36,230 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,231 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,233 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-11-19 07:59:36,234 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,234 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-19 07:59:36,234 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-19 07:59:36,234 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,235 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse1 (div ~var_1_14~0 256))) (let ((.cse0 (* 256 .cse1))) (and (or (< (+ .cse0 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse1)) 65536)) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (or (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0)) (< ~var_1_11~0 128)) (<= .cse1 0) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-19 07:59:36,235 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-19 07:59:36,235 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-19 07:59:36,235 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 07:59:36,235 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 07:59:36,236 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 07:59:36,236 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 07:59:36,239 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 07:59:36,242 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:59:36,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:59:36 BoogieIcfgContainer [2023-11-19 07:59:36,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:59:36,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:59:36,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:59:36,259 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:59:36,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:22" (3/4) ... [2023-11-19 07:59:36,262 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:59:36,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 07:59:36,276 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-19 07:59:36,276 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:59:36,277 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:59:36,277 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:59:36,395 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:59:36,396 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:59:36,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:59:36,397 INFO L158 Benchmark]: Toolchain (without parser) took 14840.55ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 115.3MB in the beginning and 137.1MB in the end (delta: -21.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,397 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 161.5MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:36,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.88ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 102.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.46ms. Allocated memory is still 161.5MB. Free memory was 102.3MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,399 INFO L158 Benchmark]: Boogie Preprocessor took 55.53ms. Allocated memory is still 161.5MB. Free memory was 99.7MB in the beginning and 98.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,399 INFO L158 Benchmark]: RCFGBuilder took 568.36ms. Allocated memory is still 161.5MB. Free memory was 98.1MB in the beginning and 82.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,399 INFO L158 Benchmark]: TraceAbstraction took 13623.74ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 81.3MB in the beginning and 143.4MB in the end (delta: -62.1MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,400 INFO L158 Benchmark]: Witness Printer took 138.07ms. Allocated memory is still 234.9MB. Free memory was 143.4MB in the beginning and 137.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:59:36,402 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.34ms. Allocated memory is still 161.5MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.88ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 102.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.46ms. Allocated memory is still 161.5MB. Free memory was 102.3MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.53ms. Allocated memory is still 161.5MB. Free memory was 99.7MB in the beginning and 98.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.36ms. Allocated memory is still 161.5MB. Free memory was 98.1MB in the beginning and 82.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13623.74ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 81.3MB in the beginning and 143.4MB in the end (delta: -62.1MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Witness Printer took 138.07ms. Allocated memory is still 234.9MB. Free memory was 143.4MB in the beginning and 137.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 1400 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 991 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 409 mSDtfsCounter, 593 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=3, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 253 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 105 PreInvPairs, 121 NumberOfFragments, 1031 HoareAnnotationTreeSize, 105 FomulaSimplifications, 4018 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 8467 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 4824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 3911/3912 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: 95]: Loop Invariant Derived loop invariant: (((((((((((256 * (var_1_14 / 256)) + ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) < var_1_14) || (9 < var_1_14)) && (var_1_10 == 0)) && (last_1_var_1_10 == 0)) && (0 <= k_loop)) && (!((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14)) || (var_1_11 < 128))) && ((var_1_14 / 256) <= 0)) && ((0 < (129 + var_1_11)) || !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256)))))) || ((((((((256 * (var_1_14 / 256)) + ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) < var_1_14) || (9 < var_1_14)) && (1 <= k_loop)) && (!((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14)) || (var_1_11 < 128))) && ((var_1_14 / 256) <= 0)) && ((0 < (129 + var_1_11)) || !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))))) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:59:36,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26a7846-3904-484f-b139-6b1079a3d935/bin/uautomizer-verify-uCwYo4JHxu/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