./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/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_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:29:13,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:29:13,916 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:29:13,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:29:13,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:29:13,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:29:13,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:29:13,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:29:13,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:29:13,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:29:13,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:29:13,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:29:13,974 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:29:13,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:29:13,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:29:13,977 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:29:13,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:29:13,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:29:13,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:29:13,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:29:13,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:29:13,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:29:13,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:29:13,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:29:13,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:29:13,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:29:13,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:29:13,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:29:13,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:29:13,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:29:13,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:29:13,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:29:13,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:29:13,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:29:13,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:29:13,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:29:13,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:29:13,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:29:13,989 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:29:13,990 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_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 [2023-11-06 22:29:14,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:29:14,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:29:14,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:29:14,349 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:29:14,350 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:29:14,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-06 22:29:17,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:29:17,743 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:29:17,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-06 22:29:17,754 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/data/b01713895/cf0e65dad5f54910bb7dcea7e71764f6/FLAGc311e8b2d [2023-11-06 22:29:17,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/data/b01713895/cf0e65dad5f54910bb7dcea7e71764f6 [2023-11-06 22:29:17,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:29:17,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:29:17,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:29:17,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:29:17,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:29:17,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:17" (1/1) ... [2023-11-06 22:29:17,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b6ab6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17, skipping insertion in model container [2023-11-06 22:29:17,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:17" (1/1) ... [2023-11-06 22:29:17,843 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:29:18,013 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_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-06 22:29:18,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:29:18,070 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:29:18,084 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_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-06 22:29:18,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:29:18,130 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:29:18,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18 WrapperNode [2023-11-06 22:29:18,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:29:18,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:29:18,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:29:18,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:29:18,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,206 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-06 22:29:18,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:29:18,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:29:18,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:29:18,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:29:18,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:29:18,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:29:18,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:29:18,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:29:18,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (1/1) ... [2023-11-06 22:29:18,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:29:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:29:18,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:29:18,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:29:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:29:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:29:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:29:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:29:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:29:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:29:18,487 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:29:18,491 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:29:18,833 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:29:18,840 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:29:18,840 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:29:18,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:18 BoogieIcfgContainer [2023-11-06 22:29:18,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:29:18,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:29:18,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:29:18,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:29:18,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:29:17" (1/3) ... [2023-11-06 22:29:18,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ffeef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:18, skipping insertion in model container [2023-11-06 22:29:18,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:18" (2/3) ... [2023-11-06 22:29:18,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ffeef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:18, skipping insertion in model container [2023-11-06 22:29:18,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:18" (3/3) ... [2023-11-06 22:29:18,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-06 22:29:18,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:29:18,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:29:18,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:29:18,936 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7635c34c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:29:18,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:29:18,941 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-06 22:29:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:29:18,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:18,955 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-06 22:29:18,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:29:18,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash 400622614, now seen corresponding path program 1 times [2023-11-06 22:29:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356617771] [2023-11-06 22:29:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:29:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:29:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:29:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:29:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:29:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:29:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:29:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:29:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:29:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:29:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:29:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:29:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:29:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,997 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-06 22:29:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356617771] [2023-11-06 22:29:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356617771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:29:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243297482] [2023-11-06 22:29:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:22,049 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-06 22:29:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:22,799 INFO L93 Difference]: Finished difference Result 172 states and 287 transitions. [2023-11-06 22:29:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:22,802 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-06 22:29:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:22,812 INFO L225 Difference]: With dead ends: 172 [2023-11-06 22:29:22,813 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:29:22,816 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-06 22:29:22,820 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-06 22:29:22,822 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-06 22:29:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:29:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2023-11-06 22:29:22,902 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-06 22:29:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2023-11-06 22:29:22,906 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 87 [2023-11-06 22:29:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:22,907 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2023-11-06 22:29:22,908 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-06 22:29:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2023-11-06 22:29:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:29:22,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:22,912 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-06 22:29:22,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:29:22,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:29:22,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1313057984, now seen corresponding path program 1 times [2023-11-06 22:29:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505534244] [2023-11-06 22:29:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:29:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:29:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:29:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:29:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:29:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:29:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:29:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:29:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:29:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:29:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:29:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:29:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:29:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,124 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-06 22:29:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505534244] [2023-11-06 22:29:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505534244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:29:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298408137] [2023-11-06 22:29:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:23,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:23,129 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-06 22:29:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:23,274 INFO L93 Difference]: Finished difference Result 211 states and 294 transitions. [2023-11-06 22:29:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:23,275 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-06 22:29:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:23,278 INFO L225 Difference]: With dead ends: 211 [2023-11-06 22:29:23,279 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:29:23,280 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-06 22:29:23,282 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-06 22:29:23,283 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-06 22:29:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:29:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2023-11-06 22:29:23,359 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-06 22:29:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2023-11-06 22:29:23,362 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 88 [2023-11-06 22:29:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:23,363 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2023-11-06 22:29:23,363 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-06 22:29:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2023-11-06 22:29:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:29:23,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:23,365 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-06 22:29:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:29:23,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:29:23,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash 764583191, now seen corresponding path program 1 times [2023-11-06 22:29:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177752103] [2023-11-06 22:29:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:29:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:29:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:29:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:29:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:29:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:29:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:29:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:29:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:29:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:29:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:29:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:29:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:29:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,629 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-06 22:29:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177752103] [2023-11-06 22:29:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177752103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:29:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116148867] [2023-11-06 22:29:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:29:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:29:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:29:24,632 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-06 22:29:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:25,596 INFO L93 Difference]: Finished difference Result 234 states and 330 transitions. [2023-11-06 22:29:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:29:25,597 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-06 22:29:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:25,601 INFO L225 Difference]: With dead ends: 234 [2023-11-06 22:29:25,601 INFO L226 Difference]: Without dead ends: 232 [2023-11-06 22:29:25,602 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-06 22:29:25,604 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 57 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:25,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 389 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:29:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-06 22:29:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 137. [2023-11-06 22:29:25,688 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-06 22:29:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2023-11-06 22:29:25,690 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 88 [2023-11-06 22:29:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:25,691 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2023-11-06 22:29:25,692 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-06 22:29:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2023-11-06 22:29:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:29:25,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:25,694 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-06 22:29:25,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:29:25,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:29:25,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 766430233, now seen corresponding path program 1 times [2023-11-06 22:29:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676937193] [2023-11-06 22:29:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:29:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:29:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:29:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:29:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:29:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:29:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:29:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:29:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:29:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:29:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:29:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:29:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:29:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,774 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-06 22:29:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676937193] [2023-11-06 22:29:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676937193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:27,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:29:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612522909] [2023-11-06 22:29:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:29:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:29:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:29:27,783 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-06 22:29:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:29,411 INFO L93 Difference]: Finished difference Result 255 states and 365 transitions. [2023-11-06 22:29:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:29:29,417 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-06 22:29:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:29,420 INFO L225 Difference]: With dead ends: 255 [2023-11-06 22:29:29,420 INFO L226 Difference]: Without dead ends: 253 [2023-11-06 22:29:29,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:29:29,422 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:29,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 405 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:29:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-06 22:29:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2023-11-06 22:29:29,509 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-06 22:29:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2023-11-06 22:29:29,512 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 88 [2023-11-06 22:29:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:29,514 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2023-11-06 22:29:29,515 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-06 22:29:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2023-11-06 22:29:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-06 22:29:29,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:29,528 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-06 22:29:29,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:29:29,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:29:29,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 106134182, now seen corresponding path program 1 times [2023-11-06 22:29:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333841205] [2023-11-06 22:29:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:29:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:29:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:29:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:29:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:29:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:29:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:29:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:29:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:29:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:29:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:29:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:29:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:29:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 22:29:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:29:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:29:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:29:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:29:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:29:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:29:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:29:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-06 22:29:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:29:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-06 22:29:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 22:29:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 22:29:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,777 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-06 22:29:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333841205] [2023-11-06 22:29:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333841205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:29:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807650120] [2023-11-06 22:29:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:29:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:29:29,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:29:29,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:29:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:29:29,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:29:30,121 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-06 22:29:30,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:29:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807650120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:29:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-06 22:29:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601935627] [2023-11-06 22:29:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:30,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:30,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:30,124 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-06 22:29:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:30,191 INFO L93 Difference]: Finished difference Result 182 states and 249 transitions. [2023-11-06 22:29:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:30,192 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-06 22:29:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:30,192 INFO L225 Difference]: With dead ends: 182 [2023-11-06 22:29:30,192 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:29:30,194 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-06 22:29:30,195 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:30,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:29:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:29:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:29:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:29:30,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2023-11-06 22:29:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:30,197 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:29:30,197 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-06 22:29:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:29:30,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:29:30,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:29:30,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:29:30,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:29:30,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:29:32,822 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-11-06 22:29:32,822 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:29:32,822 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:29:32,822 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-11-06 22:29:32,823 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse5 (* ~var_1_14~0 65535)) (.cse2 (div ~var_1_14~0 256))) (let ((.cse1 (div (+ .cse5 16 (* (- 16776960) .cse2)) 65536)) (.cse0 (* 256 .cse2))) (and (or (< (+ .cse0 .cse1) ~var_1_14~0) (< 9 ~var_1_14~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)) (<= .cse2 0) (let ((.cse3 (* 65536 .cse1)) (.cse4 (* .cse2 16776960))) (or (and (= (+ 65520 .cse3 ~var_1_1~0 .cse4) .cse5) (<= (+ 32752 .cse3 .cse4) .cse5)) (and (<= .cse5 (+ 32751 .cse3 .cse4)) (= (+ .cse5 16) (+ .cse3 ~var_1_1~0 .cse4))))) (or (< 0 (+ 129 ~var_1_11~0)) (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0)))))) [2023-11-06 22:29:32,823 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-06 22:29:32,824 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-06 22:29:32,824 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 91 103) the Hoare annotation is: true [2023-11-06 22:29:32,824 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:29:32,824 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:29:32,825 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-06 22:29:32,825 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-11-06 22:29:32,825 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-06 22:29:32,825 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-06 22:29:32,826 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-06 22:29:32,826 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:29:32,826 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:29:32,826 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:29:32,826 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-06 22:29:32,827 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 87 90) the Hoare annotation is: (and (let ((.cse11 (* ~var_1_14~0 65535)) (.cse12 (div ~var_1_14~0 256))) (let ((.cse8 (* 256 .cse12)) (.cse13 (div (+ .cse11 16 (* (- 16776960) .cse12)) 65536))) (let ((.cse0 (or (< (+ .cse8 .cse13) ~var_1_14~0) (< 9 ~var_1_14~0))) (.cse1 (= (+ ~var_1_6~0 .cse8) ~var_1_14~0)) (.cse2 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse3 (or (= (+ (* (div ~var_1_16~0 256) 256) ~var_1_14~0) (+ .cse8 ~var_1_16~0)) (< ~var_1_3~0 ~last_1_var_1_6~0) (= (* 256 (div ~last_1_var_1_10~0 256)) ~last_1_var_1_10~0))) (.cse6 (<= .cse12 0)) (.cse7 (let ((.cse9 (* 65536 .cse13)) (.cse10 (* .cse12 16776960))) (or (and (= (+ 65520 .cse9 ~var_1_1~0 .cse10) .cse11) (<= (+ 32752 .cse9 .cse10) .cse11)) (and (<= .cse11 (+ 32751 .cse9 .cse10)) (= (+ .cse11 16) (+ .cse9 ~var_1_1~0 .cse10))))))) (or (and .cse0 .cse1 .cse2 (< 0 (+ 129 ~var_1_11~0)) .cse3 (< ~var_1_11~0 128) (let ((.cse4 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse5 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0))) (or (and (= ~var_1_10~0 1) (or (not .cse4) (not .cse5))) (and (= ~var_1_10~0 0) .cse4 .cse5))) .cse6 .cse7) (and .cse0 .cse1 .cse2 (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse8)) (not (= (+ .cse8 ~var_1_11~0) ~var_1_14~0)) .cse3 .cse6 .cse7))))) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-06 22:29:32,827 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-06 22:29:32,828 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-06 22:29:32,828 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-06 22:29:32,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:29:32,828 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-06 22:29:32,829 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-06 22:29:32,829 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 95 101) no Hoare annotation was computed. [2023-11-06 22:29:32,829 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-06 22:29:32,829 INFO L899 garLoopResultBuilder]: For program point L95-4(lines 95 101) no Hoare annotation was computed. [2023-11-06 22:29:32,830 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 86) no Hoare annotation was computed. [2023-11-06 22:29:32,830 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:29:32,830 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:29:32,830 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:29:32,830 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:29:32,831 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-06 22:29:32,831 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-06 22:29:32,831 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-11-06 22:29:32,831 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-06 22:29:32,832 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-06 22:29:32,832 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-06 22:29:32,832 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-06 22:29:32,832 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-06 22:29:32,833 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-06 22:29:32,833 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-06 22:29:32,833 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:29:32,833 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:29:32,833 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:29:32,833 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:29:32,837 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:29:32,839 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:29:32,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:29:32 BoogieIcfgContainer [2023-11-06 22:29:32,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:29:32,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:29:32,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:29:32,865 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:29:32,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:18" (3/4) ... [2023-11-06 22:29:32,868 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:29:32,872 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:29:32,877 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:29:32,878 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:29:32,878 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:29:32,878 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:29:32,912 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && (0 < (129 + var_1_11))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (var_1_11 < 128)) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((((((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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) && (0 <= k_loop)) [2023-11-06 22:29:32,963 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && (0 < (129 + var_1_11))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (var_1_11 < 128)) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((((((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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) && (0 <= k_loop)) [2023-11-06 22:29:32,976 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:29:32,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:29:32,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:29:32,977 INFO L158 Benchmark]: Toolchain (without parser) took 15194.24ms. Allocated memory was 125.8MB in the beginning and 272.6MB in the end (delta: 146.8MB). Free memory was 78.5MB in the beginning and 242.1MB in the end (delta: -163.6MB). Peak memory consumption was 146.5MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,978 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:29:32,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.62ms. Allocated memory is still 125.8MB. Free memory was 78.5MB in the beginning and 66.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.99ms. Allocated memory is still 125.8MB. Free memory was 66.0MB in the beginning and 63.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,978 INFO L158 Benchmark]: Boogie Preprocessor took 35.78ms. Allocated memory is still 125.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:29:32,979 INFO L158 Benchmark]: RCFGBuilder took 598.93ms. Allocated memory was 125.8MB in the beginning and 188.7MB in the end (delta: 62.9MB). Free memory was 61.5MB in the beginning and 152.4MB in the end (delta: -90.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,979 INFO L158 Benchmark]: TraceAbstraction took 14019.20ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 151.6MB in the beginning and 85.7MB in the end (delta: 65.9MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,980 INFO L158 Benchmark]: Witness Printer took 111.81ms. Allocated memory is still 272.6MB. Free memory was 85.7MB in the beginning and 242.1MB in the end (delta: -156.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:29:32,982 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.33ms. Allocated memory is still 104.9MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.62ms. Allocated memory is still 125.8MB. Free memory was 78.5MB in the beginning and 66.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.99ms. Allocated memory is still 125.8MB. Free memory was 66.0MB in the beginning and 63.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.78ms. Allocated memory is still 125.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 598.93ms. Allocated memory was 125.8MB in the beginning and 188.7MB in the end (delta: 62.9MB). Free memory was 61.5MB in the beginning and 152.4MB in the end (delta: -90.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14019.20ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 151.6MB in the beginning and 85.7MB in the end (delta: 65.9MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. * Witness Printer took 111.81ms. Allocated memory is still 272.6MB. Free memory was 85.7MB in the beginning and 242.1MB in the end (delta: -156.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 547 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 409 mSDtfsCounter, 547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.4s 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, 18 LocationsWithAnnotation, 108 PreInvPairs, 131 NumberOfFragments, 1622 HoareAnnotationTreeSize, 108 FomulaSimplifications, 6809 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 9967 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s 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: 91]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: 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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && (0 < (129 + var_1_11))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (var_1_11 < 128)) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((((((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_6 + (256 * (var_1_14 / 256))) == var_1_14)) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) && (0 <= k_loop)) - 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))))))) - InvariantResult [Line: 19]: 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)) && (0 <= k_loop)) && (!((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14)) || (var_1_11 < 128))) && ((var_1_14 / 256) <= 0)) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) && ((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-06 22:29:33,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c95262c6-852e-4cf0-9bdf-9e4a81929ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE