./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:04:47,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:04:48,023 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:04:48,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:04:48,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:04:48,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:04:48,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:04:48,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:04:48,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:04:48,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:04:48,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:04:48,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:04:48,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:04:48,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:04:48,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:04:48,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:04:48,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:04:48,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:04:48,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:04:48,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:04:48,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:04:48,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 [2024-11-13 14:04:48,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:04:48,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:04:48,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:04:48,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:04:48,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:04:48,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i Unable to find full path for "g++" [2024-11-13 14:04:50,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:04:50,652 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:04:50,656 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2024-11-13 14:04:50,672 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/b79aad287/11fac23c93d14e04ad9a4d55bc371981/FLAGb583f7657 [2024-11-13 14:04:50,957 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/b79aad287/11fac23c93d14e04ad9a4d55bc371981 [2024-11-13 14:04:50,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:04:50,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:04:50,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:04:50,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:04:50,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:04:50,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:04:50" (1/1) ... [2024-11-13 14:04:50,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3454f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:50, skipping insertion in model container [2024-11-13 14:04:50,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:04:50" (1/1) ... [2024-11-13 14:04:50,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:04:51,171 WARN L250 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_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2024-11-13 14:04:51,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:04:51,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:04:51,272 WARN L250 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_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2024-11-13 14:04:51,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:04:51,361 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:04:51,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51 WrapperNode [2024-11-13 14:04:51,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:04:51,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:04:51,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:04:51,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:04:51,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,460 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-13 14:04:51,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:04:51,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:04:51,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:04:51,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:04:51,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,520 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:04:51,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:04:51,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:04:51,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:04:51,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:04:51,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (1/1) ... [2024-11-13 14:04:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:04:51,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:51,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:04:51,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:04:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:04:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:04:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:04:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:04:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:04:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:04:51,716 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:04:51,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:04:52,120 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 14:04:52,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:04:52,131 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:04:52,131 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:04:52,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:52 BoogieIcfgContainer [2024-11-13 14:04:52,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:04:52,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:04:52,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:04:52,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:04:52,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:04:50" (1/3) ... [2024-11-13 14:04:52,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1fecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:52, skipping insertion in model container [2024-11-13 14:04:52,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:51" (2/3) ... [2024-11-13 14:04:52,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1fecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:52, skipping insertion in model container [2024-11-13 14:04:52,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:52" (3/3) ... [2024-11-13 14:04:52,142 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-28.i [2024-11-13 14:04:52,158 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:04:52,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-28.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:04:52,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:04:52,229 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c1c6d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:04:52,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:04:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:04:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:04:52,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:52,252 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:52,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:52,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 281720958, now seen corresponding path program 1 times [2024-11-13 14:04:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803573071] [2024-11-13 14:04:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:04:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:04:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:04:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:04:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:04:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:04:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:04:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:04:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:04:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:04:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:04:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:04:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:04:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:04:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:04:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:04:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:04:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:04:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:04:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:04:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:04:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:04:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:04:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:52,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803573071] [2024-11-13 14:04:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803573071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:52,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:04:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447029692] [2024-11-13 14:04:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:04:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:52,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:04:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:04:52,761 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:04:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:52,800 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2024-11-13 14:04:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:04:52,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-13 14:04:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:52,812 INFO L225 Difference]: With dead ends: 137 [2024-11-13 14:04:52,812 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 14:04:52,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:04:52,820 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:52,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:04:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 14:04:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 14:04:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:04:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-13 14:04:52,881 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 141 [2024-11-13 14:04:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:52,883 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-13 14:04:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:04:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-13 14:04:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:04:52,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:52,892 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:04:52,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 418349254, now seen corresponding path program 1 times [2024-11-13 14:04:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385889182] [2024-11-13 14:04:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:06:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:06:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:06:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:06:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:06:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:06:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:06:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:06:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:06:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:06:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:06:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:06:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:06:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:06:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:06:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:06:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:06:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:06:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:06:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:06:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:06:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:06:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:06:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:06:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:06:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385889182] [2024-11-13 14:06:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385889182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:06:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:06:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:06:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456403501] [2024-11-13 14:06:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:06:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:06:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:06:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:06:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:06:12,098 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:06:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:06:14,337 INFO L93 Difference]: Finished difference Result 262 states and 397 transitions. [2024-11-13 14:06:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:06:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-13 14:06:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:06:14,341 INFO L225 Difference]: With dead ends: 262 [2024-11-13 14:06:14,342 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 14:06:14,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:06:14,344 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 390 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:06:14,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 401 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:06:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 14:06:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2024-11-13 14:06:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 14:06:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 216 transitions. [2024-11-13 14:06:14,377 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 216 transitions. Word has length 141 [2024-11-13 14:06:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:06:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 216 transitions. [2024-11-13 14:06:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:06:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 216 transitions. [2024-11-13 14:06:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:06:14,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:06:14,382 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:06:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:06:14,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:06:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:06:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1119413832, now seen corresponding path program 1 times [2024-11-13 14:06:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:06:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932603908] [2024-11-13 14:06:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:06:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:06:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:07:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:07:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:07:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:07:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:07:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:07:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:07:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:07:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:07:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:07:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:07:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:07:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:07:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:07:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:07:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:07:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:07:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:07:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:07:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:07:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:07:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:07:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:07:07,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932603908] [2024-11-13 14:07:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932603908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:07,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:07:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513516802] [2024-11-13 14:07:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:07,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:07:07,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:07,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:07:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:07:07,054 INFO L87 Difference]: Start difference. First operand 140 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:07:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:09,745 INFO L93 Difference]: Finished difference Result 334 states and 508 transitions. [2024-11-13 14:07:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:07:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-13 14:07:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:09,749 INFO L225 Difference]: With dead ends: 334 [2024-11-13 14:07:09,750 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 14:07:09,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:07:09,752 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 277 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:09,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 446 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:07:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 14:07:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 143. [2024-11-13 14:07:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 14:07:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 222 transitions. [2024-11-13 14:07:09,784 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 222 transitions. Word has length 141 [2024-11-13 14:07:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 222 transitions. [2024-11-13 14:07:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:07:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 222 transitions. [2024-11-13 14:07:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:07:09,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:09,788 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:09,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:07:09,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:09,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash 676514692, now seen corresponding path program 1 times [2024-11-13 14:07:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309505618] [2024-11-13 14:07:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:07:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:07:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:07:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:07:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:07:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:07:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:07:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:07:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:07:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:07:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:07:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:07:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:07:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:07:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:07:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:07:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:07:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:07:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:07:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:07:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:07:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:07:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:07:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309505618] [2024-11-13 14:07:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309505618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:07:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940342925] [2024-11-13 14:07:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:10,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:10,071 INFO L87 Difference]: Start difference. First operand 143 states and 222 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:07:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:10,264 INFO L93 Difference]: Finished difference Result 447 states and 690 transitions. [2024-11-13 14:07:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-13 14:07:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:10,269 INFO L225 Difference]: With dead ends: 447 [2024-11-13 14:07:10,269 INFO L226 Difference]: Without dead ends: 307 [2024-11-13 14:07:10,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:07:10,271 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:10,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 313 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:07:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-13 14:07:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 267. [2024-11-13 14:07:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 14:07:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 413 transitions. [2024-11-13 14:07:10,349 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 413 transitions. Word has length 141 [2024-11-13 14:07:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:10,350 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 413 transitions. [2024-11-13 14:07:10,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:07:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 413 transitions. [2024-11-13 14:07:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 14:07:10,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:10,353 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:10,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:07:10,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1627219532, now seen corresponding path program 1 times [2024-11-13 14:07:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175512769] [2024-11-13 14:07:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:09:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:09:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:09:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:09:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:09:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:09:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:09:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:09:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:09:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:09:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:09:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:09:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:09:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:09:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:09:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:09:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:09:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:09:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:09:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:09:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:09:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:09:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:09:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:38,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175512769] [2024-11-13 14:09:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175512769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:09:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699291522] [2024-11-13 14:09:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:38,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:09:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:38,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:09:38,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:09:38,338 INFO L87 Difference]: Start difference. First operand 267 states and 413 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:09:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:40,471 INFO L93 Difference]: Finished difference Result 638 states and 959 transitions. [2024-11-13 14:09:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:09:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-13 14:09:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:40,479 INFO L225 Difference]: With dead ends: 638 [2024-11-13 14:09:40,480 INFO L226 Difference]: Without dead ends: 510 [2024-11-13 14:09:40,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:09:40,482 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 273 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 488 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:09:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-13 14:09:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 291. [2024-11-13 14:09:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 198 states have (on average 1.4141414141414141) internal successors, (280), 198 states have internal predecessors, (280), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 14:09:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 456 transitions. [2024-11-13 14:09:40,558 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 456 transitions. Word has length 142 [2024-11-13 14:09:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:40,559 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 456 transitions. [2024-11-13 14:09:40,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:09:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 456 transitions. [2024-11-13 14:09:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 14:09:40,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:40,563 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:40,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:09:40,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1987689394, now seen corresponding path program 1 times [2024-11-13 14:09:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823919220] [2024-11-13 14:09:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:14:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:14:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:14:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:14:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:14:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:14:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:14:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:14:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:14:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:14:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:14:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:14:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:14:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:14:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:14:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:14:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:14:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:14:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:14:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:14:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:14:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:14:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:14:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:38,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823919220] [2024-11-13 14:14:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823919220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:14:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:14:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:14:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987709337] [2024-11-13 14:14:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:14:38,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:14:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:14:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:14:38,153 INFO L87 Difference]: Start difference. First operand 291 states and 456 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:14:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:41,655 INFO L93 Difference]: Finished difference Result 738 states and 1115 transitions. [2024-11-13 14:14:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:14:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-13 14:14:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:41,660 INFO L225 Difference]: With dead ends: 738 [2024-11-13 14:14:41,661 INFO L226 Difference]: Without dead ends: 586 [2024-11-13 14:14:41,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:14:41,663 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 216 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:41,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 435 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 14:14:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-13 14:14:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 430. [2024-11-13 14:14:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 301 states have (on average 1.3820598006644518) internal successors, (416), 305 states have internal predecessors, (416), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-13 14:14:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 656 transitions. [2024-11-13 14:14:41,718 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 656 transitions. Word has length 142 [2024-11-13 14:14:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:41,719 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 656 transitions. [2024-11-13 14:14:41,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:14:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 656 transitions. [2024-11-13 14:14:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 14:14:41,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:41,721 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:41,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:14:41,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1966683186, now seen corresponding path program 1 times [2024-11-13 14:14:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409453748] [2024-11-13 14:14:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:16:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:16:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:16:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:16:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:16:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:16:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:16:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:16:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:16:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:16:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:16:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:16:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:16:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:16:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:16:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:16:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:16:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:16:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:16:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:16:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:16:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:16:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:16:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:16:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409453748] [2024-11-13 14:16:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409453748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:16:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:16:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:16:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386796746] [2024-11-13 14:16:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:16:46,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:16:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:16:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:16:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:16:46,780 INFO L87 Difference]: Start difference. First operand 430 states and 656 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:16:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:16:48,282 INFO L93 Difference]: Finished difference Result 764 states and 1150 transitions. [2024-11-13 14:16:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:16:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-13 14:16:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:16:48,287 INFO L225 Difference]: With dead ends: 764 [2024-11-13 14:16:48,288 INFO L226 Difference]: Without dead ends: 539 [2024-11-13 14:16:48,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:16:48,290 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 194 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:16:48,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 512 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:16:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-13 14:16:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 445. [2024-11-13 14:16:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 316 states have (on average 1.3955696202531647) internal successors, (441), 320 states have internal predecessors, (441), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-13 14:16:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 681 transitions. [2024-11-13 14:16:48,373 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 681 transitions. Word has length 142 [2024-11-13 14:16:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:16:48,374 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 681 transitions. [2024-11-13 14:16:48,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:16:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 681 transitions. [2024-11-13 14:16:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 14:16:48,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:16:48,376 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:16:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:16:48,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:16:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:16:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1286624816, now seen corresponding path program 1 times [2024-11-13 14:16:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:16:48,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121729203] [2024-11-13 14:16:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:16:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:16:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:16:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:16:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:16:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:16:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:16:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:16:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:16:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:16:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:16:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:16:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:16:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:16:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:16:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:16:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:16:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:16:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:16:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:16:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:16:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:16:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:16:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:16:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-13 14:16:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:16:48,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121729203] [2024-11-13 14:16:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121729203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:16:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:16:48,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:16:48,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411871436] [2024-11-13 14:16:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:16:48,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:16:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:16:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:16:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:16:48,508 INFO L87 Difference]: Start difference. First operand 445 states and 681 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:16:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:16:48,783 INFO L93 Difference]: Finished difference Result 1537 states and 2360 transitions. [2024-11-13 14:16:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:16:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-13 14:16:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:16:48,796 INFO L225 Difference]: With dead ends: 1537 [2024-11-13 14:16:48,796 INFO L226 Difference]: Without dead ends: 1095 [2024-11-13 14:16:48,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:16:48,799 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 178 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:16:48,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 411 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:16:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-13 14:16:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 522. [2024-11-13 14:16:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 393 states have (on average 1.4045801526717556) internal successors, (552), 397 states have internal predecessors, (552), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-13 14:16:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 792 transitions. [2024-11-13 14:16:48,908 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 792 transitions. Word has length 142 [2024-11-13 14:16:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:16:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 792 transitions. [2024-11-13 14:16:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-13 14:16:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 792 transitions. [2024-11-13 14:16:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:16:48,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:16:48,910 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:16:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:16:48,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:16:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:16:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2053219681, now seen corresponding path program 1 times [2024-11-13 14:16:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:16:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851323369] [2024-11-13 14:16:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:16:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:16:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:16:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573318216] [2024-11-13 14:16:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:16:48,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:16:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:16:48,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:16:48,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:16:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:16:49,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:16:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:16:49,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:16:49,310 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:16:49,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:16:49,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:16:49,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 14:16:49,521 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:16:49,663 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:16:49,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:16:49 BoogieIcfgContainer [2024-11-13 14:16:49,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:16:49,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:16:49,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:16:49,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:16:49,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:52" (3/4) ... [2024-11-13 14:16:49,677 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:16:49,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:16:49,679 INFO L158 Benchmark]: Toolchain (without parser) took 718718.42ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.2MB in the beginning and 760.9MB in the end (delta: -643.7MB). Peak memory consumption was 488.2MB. Max. memory is 16.1GB. [2024-11-13 14:16:49,679 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:16:49,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 101.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:16:49,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.18ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 96.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:16:49,680 INFO L158 Benchmark]: Boogie Preprocessor took 95.33ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 85.5MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:16:49,681 INFO L158 Benchmark]: RCFGBuilder took 571.35ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 59.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:16:49,681 INFO L158 Benchmark]: TraceAbstraction took 717539.62ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 59.3MB in the beginning and 761.2MB in the end (delta: -701.9MB). Peak memory consumption was 429.5MB. Max. memory is 16.1GB. [2024-11-13 14:16:49,681 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 1.3GB. Free memory was 761.2MB in the beginning and 760.9MB in the end (delta: 271.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:16:49,683 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.59ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 101.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.18ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 96.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 95.33ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 85.5MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 571.35ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 59.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 717539.62ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 59.3MB in the beginning and 761.2MB in the end (delta: -701.9MB). Peak memory consumption was 429.5MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 1.3GB. Free memory was 761.2MB in the beginning and 760.9MB in the end (delta: 271.0kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] unsigned char var_1_6 = 4; [L24] unsigned char var_1_7 = 2; [L25] unsigned char var_1_8 = 128; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 100; [L28] signed short int var_1_11 = 10; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] unsigned char var_1_14 = 0; [L32] signed long int var_1_15 = 128; [L33] unsigned char var_1_16 = 128; [L34] unsigned char var_1_17 = 5; [L35] double var_1_18 = 3.6; [L36] double var_1_19 = 31.45; [L37] float var_1_20 = 50.25; [L38] float var_1_21 = 9.8; [L39] float var_1_22 = 4.65; [L40] float var_1_23 = 99.65; [L41] unsigned short int last_1_var_1_1 = 4; [L42] unsigned char last_1_var_1_6 = 4; [L43] signed short int last_1_var_1_11 = 10; [L44] signed long int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=2, var_1_8=128, var_1_9=0] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L131] last_1_var_1_1 = var_1_1 [L132] last_1_var_1_6 = var_1_6 [L133] last_1_var_1_11 = var_1_11 [L134] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=2, var_1_8=128, var_1_9=0] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L94] var_1_7 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_8=128, var_1_9=0] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_8=128, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=128, var_1_9=0] [L96] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=128, var_1_9=0] [L97] var_1_8 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=0] [L100] var_1_9 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0] [L101] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0] [L102] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L102] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=100, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L103] var_1_10 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L104] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L105] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L105] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L106] var_1_12 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L107] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L108] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L108] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L109] var_1_13 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L110] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L111] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L111] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L116] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L117] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L117] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=5, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L118] var_1_17 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L119] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L120] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L120] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_19=629/20, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L121] var_1_19 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L122] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_21=49/5, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L123] var_1_21 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L124] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_22=93/20, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L125] var_1_22 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L126] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_23=1993/20, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L127] var_1_23 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L128] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L145] RET updateVariables() [L146] CALL step() [L48] COND FALSE !(\read(var_1_12)) [L59] var_1_11 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=-255] [L61] COND TRUE last_1_var_1_1 < 5 [L62] var_1_6 = ((((((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) > (var_1_10)) ? (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=4, var_1_20=201/4, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L66] COND TRUE var_1_11 <= var_1_6 [L67] var_1_1 = ((((((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) > (var_1_6)) ? (((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) : (var_1_6))) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=11, var_1_20=201/4, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L69] COND FALSE !(\read(var_1_13)) [L82] var_1_20 = var_1_23 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L84] COND TRUE var_1_6 <= (((((128) > (var_1_16)) ? (128) : (var_1_16))) - var_1_17) [L85] var_1_15 = (((((var_1_6 - var_1_6)) > (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))))) ? ((var_1_6 - var_1_6)) : (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L89] EXPR 200 << var_1_15 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=18/5, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L89] COND TRUE ((200 << var_1_15) * (var_1_17 * var_1_7)) < var_1_1 [L90] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR (((((var_1_11 <= var_1_6) ? (var_1_1 == ((unsigned short int) ((((((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) > (var_1_6)) ? (((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) : (var_1_6))))) : 1) && ((last_1_var_1_1 < 5) ? (var_1_6 == ((unsigned char) ((((((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) > (var_1_10)) ? (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) : (var_1_10))))) : (var_1_6 == ((unsigned char) var_1_10)))) && (var_1_12 ? (var_1_13 ? (((last_1_var_1_6 > (~ var_1_10)) && var_1_14) ? (var_1_11 == ((signed short int) ((((var_1_8) > ((var_1_10 + last_1_var_1_15))) ? (var_1_8) : ((var_1_10 + last_1_var_1_15)))))) : (var_1_11 == ((signed short int) last_1_var_1_6))) : (var_1_11 == ((signed short int) var_1_8))) : (var_1_11 == ((signed short int) last_1_var_1_11)))) && ((var_1_6 <= (((((128) > (var_1_16)) ? (128) : (var_1_16))) - var_1_17)) ? (var_1_15 == ((signed long int) (((((var_1_6 - var_1_6)) > (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))))) ? ((var_1_6 - var_1_6)) : (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7)))))))) : (var_1_15 == ((signed long int) var_1_11)))) && ((((200 << var_1_15) * (var_1_17 * var_1_7)) < var_1_1) ? (var_1_18 == ((double) var_1_19)) : 1) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L137] EXPR 200 << var_1_15 VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L137] EXPR (((((var_1_11 <= var_1_6) ? (var_1_1 == ((unsigned short int) ((((((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) > (var_1_6)) ? (((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) : (var_1_6))))) : 1) && ((last_1_var_1_1 < 5) ? (var_1_6 == ((unsigned char) ((((((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) > (var_1_10)) ? (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) : (var_1_10))))) : (var_1_6 == ((unsigned char) var_1_10)))) && (var_1_12 ? (var_1_13 ? (((last_1_var_1_6 > (~ var_1_10)) && var_1_14) ? (var_1_11 == ((signed short int) ((((var_1_8) > ((var_1_10 + last_1_var_1_15))) ? (var_1_8) : ((var_1_10 + last_1_var_1_15)))))) : (var_1_11 == ((signed short int) last_1_var_1_6))) : (var_1_11 == ((signed short int) var_1_8))) : (var_1_11 == ((signed short int) last_1_var_1_11)))) && ((var_1_6 <= (((((128) > (var_1_16)) ? (128) : (var_1_16))) - var_1_17)) ? (var_1_15 == ((signed long int) (((((var_1_6 - var_1_6)) > (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))))) ? ((var_1_6 - var_1_6)) : (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7)))))))) : (var_1_15 == ((signed long int) var_1_11)))) && ((((200 << var_1_15) * (var_1_17 * var_1_7)) < var_1_1) ? (var_1_18 == ((double) var_1_19)) : 1) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L137-L138] return ((((((var_1_11 <= var_1_6) ? (var_1_1 == ((unsigned short int) ((((((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) > (var_1_6)) ? (((((var_1_11) < (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) ? (var_1_11) : (((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))))) : (var_1_6))))) : 1) && ((last_1_var_1_1 < 5) ? (var_1_6 == ((unsigned char) ((((((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) > (var_1_10)) ? (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) < (var_1_9)) ? (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))) : (var_1_9)))) : (var_1_10))))) : (var_1_6 == ((unsigned char) var_1_10)))) && (var_1_12 ? (var_1_13 ? (((last_1_var_1_6 > (~ var_1_10)) && var_1_14) ? (var_1_11 == ((signed short int) ((((var_1_8) > ((var_1_10 + last_1_var_1_15))) ? (var_1_8) : ((var_1_10 + last_1_var_1_15)))))) : (var_1_11 == ((signed short int) last_1_var_1_6))) : (var_1_11 == ((signed short int) var_1_8))) : (var_1_11 == ((signed short int) last_1_var_1_11)))) && ((var_1_6 <= (((((128) > (var_1_16)) ? (128) : (var_1_16))) - var_1_17)) ? (var_1_15 == ((signed long int) (((((var_1_6 - var_1_6)) > (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))))) ? ((var_1_6 - var_1_6)) : (((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7)))))))) : (var_1_15 == ((signed long int) var_1_11)))) && ((((200 << var_1_15) * (var_1_17 * var_1_7)) < var_1_1) ? (var_1_18 == ((double) var_1_19)) : 1)) && (var_1_13 ? (var_1_14 ? (var_1_12 ? (var_1_20 == ((float) (var_1_21 + ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))) : 1) : ((var_1_6 <= 0) ? (var_1_20 == ((float) var_1_19)) : (var_1_20 == ((float) var_1_22)))) : (var_1_20 == ((float) var_1_23))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10, last_1_var_1_15=128, last_1_var_1_1=4, last_1_var_1_6=4, var_1_10=11, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=128, var_1_17=0, var_1_18=3, var_1_19=3, var_1_1=11, var_1_20=2, var_1_23=2, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 717.3s, OverallIterations: 9, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1624 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 3109 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2248 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1627 IncrementalHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 861 mSDtfsCounter, 1627 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1193 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 702.7s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 12542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 7392/7392 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:16:49,899 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 14:16:50,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:16:52,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:16:52,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:16:52,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:16:52,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:16:52,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:16:52,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:16:52,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:16:52,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:16:52,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:16:52,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:16:52,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:16:52,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:16:52,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:16:52,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:16:52,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:16:52,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:16:52,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:16:52,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:16:52,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:16:52,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:16:52,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:16:52,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:16:52,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:16:52,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:16:52,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:16:52,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:16:52,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:16:52,697 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:16:52,697 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:16:52,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:16:52,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:16:52,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:16:52,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:16:52,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 [2024-11-13 14:16:53,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:16:53,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:16:53,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:16:53,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:16:53,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:16:53,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i Unable to find full path for "g++" [2024-11-13 14:16:55,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:16:55,341 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:16:55,353 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2024-11-13 14:16:55,370 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/82c9a8d76/b1cf31a3d5bd4dabaf8bd0c675df0e86/FLAG6514e2245 [2024-11-13 14:16:55,419 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/data/82c9a8d76/b1cf31a3d5bd4dabaf8bd0c675df0e86 [2024-11-13 14:16:55,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:16:55,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:16:55,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:16:55,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:16:55,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:16:55,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577cd136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55, skipping insertion in model container [2024-11-13 14:16:55,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:16:55,654 WARN L250 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_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2024-11-13 14:16:55,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:16:55,742 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:16:55,754 WARN L250 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_26921cf1-147e-4ea2-9318-8368a6618ca9/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2024-11-13 14:16:55,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:16:55,855 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:16:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55 WrapperNode [2024-11-13 14:16:55,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:16:55,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:16:55,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:16:55,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:16:55,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,907 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-13 14:16:55,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:16:55,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:16:55,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:16:55,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:16:55,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:16:55,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:16:55,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:16:55,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:16:55,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:16:55,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (1/1) ... [2024-11-13 14:16:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:16:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:16:56,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:16:56,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:16:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:16:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:16:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:16:56,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:16:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:16:56,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:16:56,166 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:16:56,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:16:57,078 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 14:16:57,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:16:57,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:16:57,090 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:16:57,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:16:57 BoogieIcfgContainer [2024-11-13 14:16:57,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:16:57,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:16:57,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:16:57,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:16:57,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:16:55" (1/3) ... [2024-11-13 14:16:57,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25707776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:16:57, skipping insertion in model container [2024-11-13 14:16:57,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:16:55" (2/3) ... [2024-11-13 14:16:57,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25707776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:16:57, skipping insertion in model container [2024-11-13 14:16:57,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:16:57" (3/3) ... [2024-11-13 14:16:57,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-28.i [2024-11-13 14:16:57,121 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:16:57,125 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-28.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:16:57,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:16:57,228 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cf5a8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:16:57,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:16:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:16:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 14:16:57,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:16:57,251 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:16:57,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:16:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:16:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1064907590, now seen corresponding path program 1 times [2024-11-13 14:16:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:16:57,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337385575] [2024-11-13 14:16:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:16:57,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:16:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:16:57,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:16:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 14:16:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:57,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:16:57,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:16:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-13 14:16:57,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:16:57,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:16:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337385575] [2024-11-13 14:16:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337385575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:16:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:16:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:16:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733161688] [2024-11-13 14:16:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:16:57,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:16:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:16:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:16:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:16:57,809 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:16:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:16:57,837 INFO L93 Difference]: Finished difference Result 123 states and 216 transitions. [2024-11-13 14:16:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:16:57,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2024-11-13 14:16:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:16:57,844 INFO L225 Difference]: With dead ends: 123 [2024-11-13 14:16:57,844 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 14:16:57,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:16:57,851 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:16:57,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:16:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 14:16:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-13 14:16:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:16:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2024-11-13 14:16:57,896 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 138 [2024-11-13 14:16:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:16:57,897 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2024-11-13 14:16:57,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:16:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2024-11-13 14:16:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 14:16:57,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:16:57,907 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:16:57,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 14:16:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:16:58,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:16:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:16:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 970625022, now seen corresponding path program 1 times [2024-11-13 14:16:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:16:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419402615] [2024-11-13 14:16:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:16:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:16:58,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:16:58,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:16:58,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26921cf1-147e-4ea2-9318-8368a6618ca9/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 14:16:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:16:58,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 14:16:58,530 INFO L278 TraceCheckSpWp]: Computing forward predicates...