./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.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_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:52:20,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:52:20,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:52:20,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:52:20,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:52:20,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:52:20,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:52:20,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:52:20,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:52:20,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:52:20,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:52:20,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:52:20,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:52:20,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:52:20,716 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:52:20,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:52:20,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:52:20,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:52:20,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:52:20,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:52:20,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:52:20,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:52:20,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:52:20,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:52:20,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:52:20,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:52:20,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:52:20,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:52:20,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:52:20,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:52:20,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:52:20,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:20,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:52:20,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:52:20,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:52:20,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:52:20,721 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-13 14:52:21,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:52:21,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:52:21,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:52:21,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:52:21,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:52:21,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i Unable to find full path for "g++" [2024-11-13 14:52:23,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:52:23,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:52:23,518 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-13 14:52:23,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/5687ace23/cbce5ee4403d4de3a2d3d50ce2557b16/FLAGc69cfebd4 [2024-11-13 14:52:23,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/5687ace23/cbce5ee4403d4de3a2d3d50ce2557b16 [2024-11-13 14:52:23,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:52:23,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:52:23,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:23,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:52:23,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:52:23,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:23" (1/1) ... [2024-11-13 14:52:23,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ffc8650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:23, skipping insertion in model container [2024-11-13 14:52:23,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:23" (1/1) ... [2024-11-13 14:52:23,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:52:24,059 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2024-11-13 14:52:24,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:24,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:52:24,195 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2024-11-13 14:52:24,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:24,267 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:52:24,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24 WrapperNode [2024-11-13 14:52:24,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:24,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:24,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:52:24,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:52:24,279 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:52:24" (1/1) ... [2024-11-13 14:52:24,294 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:52:24" (1/1) ... [2024-11-13 14:52:24,371 INFO L138 Inliner]: procedures = 30, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-11-13 14:52:24,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:24,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:52:24,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:52:24,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:52:24,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,400 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 14:52:24,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:52:24,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:52:24,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:52:24,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:52:24,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (1/1) ... [2024-11-13 14:52:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:24,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:52:24,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:52:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:52:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 14:52:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:52:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:52:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 14:52:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:52:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:52:24,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:52:24,725 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:52:25,453 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-13 14:52:25,453 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:52:25,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:52:25,467 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:52:25,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:25 BoogieIcfgContainer [2024-11-13 14:52:25,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:52:25,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:52:25,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:52:25,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:52:25,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:52:23" (1/3) ... [2024-11-13 14:52:25,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31662c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:25, skipping insertion in model container [2024-11-13 14:52:25,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:24" (2/3) ... [2024-11-13 14:52:25,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31662c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:25, skipping insertion in model container [2024-11-13 14:52:25,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:25" (3/3) ... [2024-11-13 14:52:25,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-13 14:52:25,511 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:52:25,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-31.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:52:25,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:52:25,611 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;@7f981aca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:52:25,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:52:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:52:25,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:25,665 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:25,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -113810893, now seen corresponding path program 1 times [2024-11-13 14:52:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071126014] [2024-11-13 14:52:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071126014] [2024-11-13 14:52:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071126014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:52:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052582169] [2024-11-13 14:52:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:26,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:52:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:26,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:52:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:52:26,329 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:26,382 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2024-11-13 14:52:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:52:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-13 14:52:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:26,396 INFO L225 Difference]: With dead ends: 167 [2024-11-13 14:52:26,397 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 14:52:26,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:52:26,410 INFO L432 NwaCegarLoop]: 121 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, 121 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:52:26,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:52:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 14:52:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 14:52:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-13 14:52:26,455 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2024-11-13 14:52:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:26,455 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-13 14:52:26,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-13 14:52:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:52:26,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:26,460 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:26,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:52:26,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:26,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1435174021, now seen corresponding path program 1 times [2024-11-13 14:52:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:26,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647993789] [2024-11-13 14:52:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647993789] [2024-11-13 14:52:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647993789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:27,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:52:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285470187] [2024-11-13 14:52:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:52:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:52:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:27,304 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:27,542 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2024-11-13 14:52:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:52:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-13 14:52:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:27,548 INFO L225 Difference]: With dead ends: 163 [2024-11-13 14:52:27,548 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 14:52:27,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:27,551 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:27,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:52:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 14:52:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 14:52:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-13 14:52:27,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2024-11-13 14:52:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-13 14:52:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-13 14:52:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:52:27,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:27,583 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:52:27,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:27,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash -153173881, now seen corresponding path program 1 times [2024-11-13 14:52:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:27,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227641692] [2024-11-13 14:52:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227641692] [2024-11-13 14:52:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227641692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:31,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:31,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:52:31,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189936890] [2024-11-13 14:52:31,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:31,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:52:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:52:31,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:52:31,900 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:32,967 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2024-11-13 14:52:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:52:32,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-13 14:52:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:32,970 INFO L225 Difference]: With dead ends: 199 [2024-11-13 14:52:32,970 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 14:52:32,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:52:32,972 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 312 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:32,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 290 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:52:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 14:52:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2024-11-13 14:52:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-13 14:52:32,995 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 94 [2024-11-13 14:52:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:32,996 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-13 14:52:32,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-13 14:52:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:52:32,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:32,998 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:32,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:52:32,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash -564019038, now seen corresponding path program 1 times [2024-11-13 14:52:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837972666] [2024-11-13 14:52:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837972666] [2024-11-13 14:52:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837972666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:33,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:52:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512671177] [2024-11-13 14:52:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:52:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:52:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:33,407 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:33,444 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-13 14:52:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:52:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-13 14:52:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:33,447 INFO L225 Difference]: With dead ends: 171 [2024-11-13 14:52:33,450 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 14:52:33,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:33,451 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:33,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:52:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 14:52:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 14:52:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-11-13 14:52:33,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 96 [2024-11-13 14:52:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-11-13 14:52:33,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-11-13 14:52:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:52:33,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:33,485 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:52:33,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash -957046048, now seen corresponding path program 1 times [2024-11-13 14:52:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874935100] [2024-11-13 14:52:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874935100] [2024-11-13 14:52:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874935100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:52:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755880112] [2024-11-13 14:52:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:52:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:37,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:52:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:52:37,494 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:38,874 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2024-11-13 14:52:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:52:38,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2024-11-13 14:52:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:38,877 INFO L225 Difference]: With dead ends: 175 [2024-11-13 14:52:38,877 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 14:52:38,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:52:38,879 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 282 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:38,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 327 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:52:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 14:52:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-13 14:52:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-13 14:52:38,904 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 96 [2024-11-13 14:52:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:38,904 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-13 14:52:38,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-13 14:52:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:52:38,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:38,907 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:52:38,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1827331119, now seen corresponding path program 1 times [2024-11-13 14:52:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375996754] [2024-11-13 14:52:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375996754] [2024-11-13 14:52:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375996754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:52:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770198409] [2024-11-13 14:52:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:39,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:52:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:52:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:52:39,520 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:40,071 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2024-11-13 14:52:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-13 14:52:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:40,077 INFO L225 Difference]: With dead ends: 209 [2024-11-13 14:52:40,077 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 14:52:40,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:52:40,082 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 126 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:40,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:52:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 14:52:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2024-11-13 14:52:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-13 14:52:40,122 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 96 [2024-11-13 14:52:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:40,122 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-13 14:52:40,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-13 14:52:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:52:40,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:40,124 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:52:40,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1237406250, now seen corresponding path program 1 times [2024-11-13 14:52:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674127975] [2024-11-13 14:52:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674127975] [2024-11-13 14:52:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674127975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:42,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:52:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907003171] [2024-11-13 14:52:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:52:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:52:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:52:42,381 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:43,222 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-11-13 14:52:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:52:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-13 14:52:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:43,225 INFO L225 Difference]: With dead ends: 202 [2024-11-13 14:52:43,226 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 14:52:43,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:52:43,228 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 168 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:43,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 266 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:52:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 14:52:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2024-11-13 14:52:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2024-11-13 14:52:43,259 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 97 [2024-11-13 14:52:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:43,261 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2024-11-13 14:52:43,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2024-11-13 14:52:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 14:52:43,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:43,264 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:43,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:52:43,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1883942955, now seen corresponding path program 1 times [2024-11-13 14:52:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605647399] [2024-11-13 14:52:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605647399] [2024-11-13 14:52:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605647399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:52:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128151300] [2024-11-13 14:52:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:52:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:52:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:52:45,922 INFO L87 Difference]: Start difference. First operand 89 states and 124 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:47,019 INFO L93 Difference]: Finished difference Result 229 states and 319 transitions. [2024-11-13 14:52:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:52:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-13 14:52:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:47,022 INFO L225 Difference]: With dead ends: 229 [2024-11-13 14:52:47,022 INFO L226 Difference]: Without dead ends: 143 [2024-11-13 14:52:47,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:52:47,023 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 275 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:47,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 376 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:52:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-13 14:52:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2024-11-13 14:52:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-11-13 14:52:47,062 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 98 [2024-11-13 14:52:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:47,063 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-11-13 14:52:47,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:52:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-11-13 14:52:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:52:47,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:47,064 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:52:47,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:47,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash 21303598, now seen corresponding path program 1 times [2024-11-13 14:52:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:47,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567277966] [2024-11-13 14:52:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567277966] [2024-11-13 14:52:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567277966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:52:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239794657] [2024-11-13 14:52:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:47,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:52:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:52:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:52:47,555 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:47,994 INFO L93 Difference]: Finished difference Result 294 states and 405 transitions. [2024-11-13 14:52:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:52:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-13 14:52:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:47,997 INFO L225 Difference]: With dead ends: 294 [2024-11-13 14:52:47,997 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 14:52:47,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:52:47,998 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 126 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:47,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 542 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:52:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 14:52:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2024-11-13 14:52:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2024-11-13 14:52:48,024 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 99 [2024-11-13 14:52:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:48,024 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2024-11-13 14:52:48,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2024-11-13 14:52:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:52:48,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:48,026 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:52:48,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:48,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -999764756, now seen corresponding path program 1 times [2024-11-13 14:52:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262846532] [2024-11-13 14:52:48,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262846532] [2024-11-13 14:52:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262846532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:48,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:48,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:52:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039682228] [2024-11-13 14:52:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:52:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:48,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:52:48,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:52:48,375 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:48,644 INFO L93 Difference]: Finished difference Result 314 states and 435 transitions. [2024-11-13 14:52:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-13 14:52:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:48,647 INFO L225 Difference]: With dead ends: 314 [2024-11-13 14:52:48,647 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 14:52:48,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:52:48,648 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 42 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:48,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 411 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:52:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 14:52:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2024-11-13 14:52:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-13 14:52:48,676 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 99 [2024-11-13 14:52:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:48,677 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-13 14:52:48,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-13 14:52:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:52:48,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:48,679 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:52:48,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1706854638, now seen corresponding path program 1 times [2024-11-13 14:52:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052761669] [2024-11-13 14:52:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052761669] [2024-11-13 14:52:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052761669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:52:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076202306] [2024-11-13 14:52:48,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:48,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:52:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:52:48,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:52:48,971 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:49,232 INFO L93 Difference]: Finished difference Result 312 states and 425 transitions. [2024-11-13 14:52:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-13 14:52:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:49,234 INFO L225 Difference]: With dead ends: 312 [2024-11-13 14:52:49,235 INFO L226 Difference]: Without dead ends: 174 [2024-11-13 14:52:49,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:52:49,236 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 42 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:49,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 403 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:52:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-13 14:52:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 129. [2024-11-13 14:52:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:52:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2024-11-13 14:52:49,259 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 99 [2024-11-13 14:52:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:49,260 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2024-11-13 14:52:49,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2024-11-13 14:52:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:52:49,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:49,261 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:52:49,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 742129579, now seen corresponding path program 1 times [2024-11-13 14:52:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:49,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902637777] [2024-11-13 14:52:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:52:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092042905] [2024-11-13 14:52:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:49,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:49,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:52:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:49,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-13 14:52:49,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:49,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2024-11-13 14:52:50,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2024-11-13 14:52:51,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:52:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:52:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:52:53,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:52:53,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:52:54,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2024-11-13 14:52:54,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:54,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:54,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2024-11-13 14:52:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:54,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:54,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:54,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:54,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2024-11-13 14:52:55,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:55,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:55,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:55,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:55,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 21 [2024-11-13 14:52:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 14:52:55,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:55,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (~WrapperStruct00_var_1_9_Pointer~0.base Int)) (or (not (= v_ArrVal_923 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_923 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_923))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (* (- 2) (mod (select (select .cse1 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)) (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))))))) (< (* (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) c_~last_1_WrapperStruct00_var_1_7~0) (+ (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1))))) is different from false [2024-11-13 14:52:55,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_922 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_922)))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_923 c_~WrapperStruct00_var_1_13_Pointer~0.offset)) v_ArrVal_923)) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_923))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (* (- 2) (mod (select (select .cse2 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)) (select (select .cse2 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))))))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (+ (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)))))) is different from false [2024-11-13 14:52:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902637777] [2024-11-13 14:52:55,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:52:55,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092042905] [2024-11-13 14:52:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092042905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:55,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:52:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-13 14:52:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432203607] [2024-11-13 14:52:55,890 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 14:52:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:52:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:55,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:52:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=192, Unknown=2, NotChecked=58, Total=306 [2024-11-13 14:52:55,892 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:57,591 INFO L93 Difference]: Finished difference Result 475 states and 643 transitions. [2024-11-13 14:52:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:52:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-11-13 14:52:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:57,594 INFO L225 Difference]: With dead ends: 475 [2024-11-13 14:52:57,594 INFO L226 Difference]: Without dead ends: 349 [2024-11-13 14:52:57,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=339, Unknown=2, NotChecked=82, Total=552 [2024-11-13 14:52:57,596 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 211 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:57,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 605 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:52:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-13 14:52:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 203. [2024-11-13 14:52:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.310734463276836) internal successors, (232), 177 states have internal predecessors, (232), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:52:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 276 transitions. [2024-11-13 14:52:57,643 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 276 transitions. Word has length 99 [2024-11-13 14:52:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:57,645 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 276 transitions. [2024-11-13 14:52:57,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:52:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 276 transitions. [2024-11-13 14:52:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:52:57,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:57,647 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:52:57,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:57,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:57,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash -528184807, now seen corresponding path program 1 times [2024-11-13 14:52:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:57,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893800730] [2024-11-13 14:52:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:52:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:52:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:52:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:52:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:52:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:52:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:52:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:52:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:52:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893800730] [2024-11-13 14:52:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893800730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:52:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468246916] [2024-11-13 14:52:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:52:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:52:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:52:58,073 INFO L87 Difference]: Start difference. First operand 203 states and 276 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:58,144 INFO L93 Difference]: Finished difference Result 333 states and 454 transitions. [2024-11-13 14:52:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-13 14:52:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:58,146 INFO L225 Difference]: With dead ends: 333 [2024-11-13 14:52:58,146 INFO L226 Difference]: Without dead ends: 207 [2024-11-13 14:52:58,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:52:58,147 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:58,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:52:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-13 14:52:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-11-13 14:52:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 178 states have internal predecessors, (233), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:52:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 277 transitions. [2024-11-13 14:52:58,184 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 277 transitions. Word has length 100 [2024-11-13 14:52:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 277 transitions. [2024-11-13 14:52:58,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:52:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 277 transitions. [2024-11-13 14:52:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:52:58,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:58,186 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:58,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:52:58,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2142682672, now seen corresponding path program 1 times [2024-11-13 14:52:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646029404] [2024-11-13 14:52:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:52:58,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903774041] [2024-11-13 14:52:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:58,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:58,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:58,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:52:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:52:59,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:52:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:52:59,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:52:59,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:52:59,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:52:59,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:52:59,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:59,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:52:59,787 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:52:59,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:52:59 BoogieIcfgContainer [2024-11-13 14:52:59,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:52:59,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:52:59,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:52:59,796 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:52:59,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:25" (3/4) ... [2024-11-13 14:52:59,800 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:52:59,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:52:59,802 INFO L158 Benchmark]: Toolchain (without parser) took 35978.35ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 119.0MB in the beginning and 516.2MB in the end (delta: -397.2MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2024-11-13 14:52:59,802 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:59,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.27ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 104.3MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:52:59,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.60ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 101.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:59,803 INFO L158 Benchmark]: Boogie Preprocessor took 58.41ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 98.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:59,803 INFO L158 Benchmark]: RCFGBuilder took 1039.15ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 69.6MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 14:52:59,804 INFO L158 Benchmark]: TraceAbstraction took 34321.55ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 69.1MB in the beginning and 516.3MB in the end (delta: -447.2MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-13 14:52:59,804 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 629.1MB. Free memory was 516.3MB in the beginning and 516.2MB in the end (delta: 85.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:59,808 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.52ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.27ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 104.3MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.60ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 101.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.41ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 98.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1039.15ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 69.6MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34321.55ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 69.1MB in the beginning and 516.3MB in the end (delta: -447.2MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 629.1MB. Free memory was 516.3MB in the beginning and 516.2MB in the end (delta: 85.9kB). 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 someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 200, 0, 1107940323, 0, 4, -32, 64, 4, 0.97, 32.6 }; [L47] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L49] signed long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L57] signed long int last_1_WrapperStruct00_var_1_7 = 4; [L58] double last_1_WrapperStruct00_var_1_13 = 0.97; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_7 [L117] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] WrapperStruct00.var_1_3 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L107] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L129] RET updateVariables() [L130] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L62] COND FALSE !(! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) [L69] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L69] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L71] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L76] COND FALSE !(((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L87] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_1_Pointer)) = (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121-L122] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1587 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1584 mSDsluCounter, 4761 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3370 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3104 IncrementalHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1391 mSDtfsCounter, 3104 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=13, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 401 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1560 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1248 ConstructedInterpolants, 8 QuantifiedInterpolants, 12896 SizeOfPredicates, 17 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2820/2860 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:52:59,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:53:02,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:53:02,717 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:53:02,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:53:02,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:53:02,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:53:02,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:53:02,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:53:02,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:53:02,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:53:02,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:53:02,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:53:02,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:53:02,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:53:02,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:53:02,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:53:02,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:53:02,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:53:02,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:53:02,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:53:02,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:53:02,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:53:02,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:53:02,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:53:02,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:53:02,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:53:02,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:53:02,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:02,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:53:02,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:53:02,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:53:02,802 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:53:02,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:53:02,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:53:02,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:53:02,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:53:02,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:53:02,803 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-13 14:53:03,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:53:03,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:53:03,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:53:03,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:53:03,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:53:03,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i Unable to find full path for "g++" [2024-11-13 14:53:05,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:53:05,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:53:05,520 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-13 14:53:05,534 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/66c554b20/0ed0c1a40e604c84abb2e91425062037/FLAG58daac9ec [2024-11-13 14:53:05,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/data/66c554b20/0ed0c1a40e604c84abb2e91425062037 [2024-11-13 14:53:05,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:53:05,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:53:05,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:05,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:53:05,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:53:05,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:05,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf5c90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05, skipping insertion in model container [2024-11-13 14:53:05,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:05,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:53:05,773 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2024-11-13 14:53:05,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:05,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:53:05,892 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_b09a56e3-33b7-4784-acb7-640bee5f3a38/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2024-11-13 14:53:05,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:05,984 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:53:05,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05 WrapperNode [2024-11-13 14:53:05,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:05,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:05,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:53:05,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:53:05,999 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:53:05" (1/1) ... [2024-11-13 14:53:06,011 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:53:05" (1/1) ... [2024-11-13 14:53:06,046 INFO L138 Inliner]: procedures = 34, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2024-11-13 14:53:06,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:06,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:53:06,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:53:06,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:53:06,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,087 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-13 14:53:06,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:53:06,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:53:06,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:53:06,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:53:06,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (1/1) ... [2024-11-13 14:53:06,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:06,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:06,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:53:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 14:53:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 14:53:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-13 14:53:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-13 14:53:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 14:53:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 14:53:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:53:06,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:53:06,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:53:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:53:06,337 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:53:06,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:53:07,232 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-13 14:53:07,232 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:53:07,247 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:53:07,247 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:53:07,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:07 BoogieIcfgContainer [2024-11-13 14:53:07,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:53:07,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:53:07,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:53:07,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:53:07,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:53:05" (1/3) ... [2024-11-13 14:53:07,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a666c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:07, skipping insertion in model container [2024-11-13 14:53:07,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:05" (2/3) ... [2024-11-13 14:53:07,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a666c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:07, skipping insertion in model container [2024-11-13 14:53:07,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:07" (3/3) ... [2024-11-13 14:53:07,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-13 14:53:07,282 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:53:07,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-31.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:53:07,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:53:07,362 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;@43cc678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:53:07,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:53:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:53:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:53:07,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:07,376 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:07,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1894060799, now seen corresponding path program 1 times [2024-11-13 14:53:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:07,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183821964] [2024-11-13 14:53:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:07,393 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:53:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:07,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:07,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:07,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:53:07,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-13 14:53:07,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:07,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183821964] [2024-11-13 14:53:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183821964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:07,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:07,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:53:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100631685] [2024-11-13 14:53:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:07,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:53:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:07,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:53:07,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:53:07,860 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:07,905 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-13 14:53:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:53:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-13 14:53:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:07,916 INFO L225 Difference]: With dead ends: 164 [2024-11-13 14:53:07,917 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 14:53:07,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:53:07,925 INFO L432 NwaCegarLoop]: 114 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, 114 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:53:07,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 14:53:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 14:53:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:53:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-13 14:53:07,983 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-13 14:53:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:07,984 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-13 14:53:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-13 14:53:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:53:07,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:07,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:08,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -851921583, now seen corresponding path program 1 times [2024-11-13 14:53:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411330505] [2024-11-13 14:53:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:08,194 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:53:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:08,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:08,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:08,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:53:08,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:08,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 14:53:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:53:08,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:08,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411330505] [2024-11-13 14:53:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411330505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195274426] [2024-11-13 14:53:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:53:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:53:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:08,735 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:08,776 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-13 14:53:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:53:08,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-13 14:53:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:08,780 INFO L225 Difference]: With dead ends: 157 [2024-11-13 14:53:08,781 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 14:53:08,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:08,783 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:08,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 14:53:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 14:53:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:53:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-13 14:53:08,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2024-11-13 14:53:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:08,801 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-13 14:53:08,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-13 14:53:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:53:08,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:08,804 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:08,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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)] Ended with exit code 0 [2024-11-13 14:53:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:09,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1854697811, now seen corresponding path program 1 times [2024-11-13 14:53:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133758737] [2024-11-13 14:53:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:09,007 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:53:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:09,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:09,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (4)] Waiting until timeout for monitored process [2024-11-13 14:53:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:09,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:53:09,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:11,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-13 14:53:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:53:12,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:12,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133758737] [2024-11-13 14:53:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133758737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:53:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542067064] [2024-11-13 14:53:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:53:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:12,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:53:12,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:53:12,101 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:13,345 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2024-11-13 14:53:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:53:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-13 14:53:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:13,349 INFO L225 Difference]: With dead ends: 191 [2024-11-13 14:53:13,349 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 14:53:13,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:53:13,350 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 145 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 292 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:53:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 14:53:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2024-11-13 14:53:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:53:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-13 14:53:13,364 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 94 [2024-11-13 14:53:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:13,365 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-13 14:53:13,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-13 14:53:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:53:13,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:13,367 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:13,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (4)] Ended with exit code 0 [2024-11-13 14:53:13,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:13,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 560361326, now seen corresponding path program 1 times [2024-11-13 14:53:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513862536] [2024-11-13 14:53:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:13,574 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:53:13,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:13,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:13,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (5)] Waiting until timeout for monitored process [2024-11-13 14:53:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:13,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:53:13,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:14,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 14:53:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:53:14,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:14,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513862536] [2024-11-13 14:53:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513862536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331084204] [2024-11-13 14:53:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:53:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:53:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:14,031 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:14,069 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2024-11-13 14:53:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:53:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-13 14:53:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:14,072 INFO L225 Difference]: With dead ends: 165 [2024-11-13 14:53:14,072 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 14:53:14,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:14,073 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:14,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 14:53:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 14:53:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:53:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 117 transitions. [2024-11-13 14:53:14,091 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 117 transitions. Word has length 96 [2024-11-13 14:53:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:14,092 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 117 transitions. [2024-11-13 14:53:14,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:53:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2024-11-13 14:53:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:53:14,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:14,094 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:14,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (5)] Ended with exit code 0 [2024-11-13 14:53:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:14,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 167334316, now seen corresponding path program 1 times [2024-11-13 14:53:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585249378] [2024-11-13 14:53:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:14,296 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:53:14,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:14,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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:53:14,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (6)] Waiting until timeout for monitored process [2024-11-13 14:53:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:14,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 14:53:14,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:15,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:53:17,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 14:53:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 14:53:18,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-13 14:53:19,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2024-11-13 14:53:24,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2024-11-13 14:53:24,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2024-11-13 14:53:24,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2024-11-13 14:53:24,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2024-11-13 14:53:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 109 proven. 61 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 14:53:25,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:47,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585249378] [2024-11-13 14:53:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585249378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216317967] [2024-11-13 14:53:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:47,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:47,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:53:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:47,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 14:53:47,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:49,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:53:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-13 14:53:52,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 14:53:53,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 14:53:55,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2024-11-13 14:54:00,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2024-11-13 14:54:01,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-13 14:54:01,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2024-11-13 14:54:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2024-11-13 14:54:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 69 proven. 85 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:54:11,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:55:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216317967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:23,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:55:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2024-11-13 14:55:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640648645] [2024-11-13 14:55:23,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:55:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:55:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:55:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:55:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=657, Unknown=23, NotChecked=0, Total=812 [2024-11-13 14:55:23,504 INFO L87 Difference]: Start difference. First operand 84 states and 117 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 7 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-13 14:55:32,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:55:36,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:55:44,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:55:52,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:55:56,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:00,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:04,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:08,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:12,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:21,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:25,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:29,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:33,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:41,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:45,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:49,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:53,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:57,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:57:14,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:57:18,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:57:38,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:57:42,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:10,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:14,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:18,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:22,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:26,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:30,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:34,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:38,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:42,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:46,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:50,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:58:54,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:15,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:19,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:23,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:27,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:32,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:36,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:48,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:59:52,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:01,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:05,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:09,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:13,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:17,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:21,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:26,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:30,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:00:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:36,768 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2024-11-13 15:00:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 15:00:36,770 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 7 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 96 [2024-11-13 15:00:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:36,771 INFO L225 Difference]: With dead ends: 201 [2024-11-13 15:00:36,772 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 15:00:36,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 211.0s TimeCoverageRelationStatistics Valid=561, Invalid=1943, Unknown=46, NotChecked=0, Total=2550 [2024-11-13 15:00:36,774 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 394 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 91 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 213.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 213.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:36,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 377 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 832 Invalid, 51 Unknown, 0 Unchecked, 213.6s Time] [2024-11-13 15:00:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 15:00:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2024-11-13 15:00:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 92 states have internal predecessors, (115), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:00:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2024-11-13 15:00:36,802 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 96 [2024-11-13 15:00:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:36,802 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions. [2024-11-13 15:00:36,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 7 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-13 15:00:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2024-11-13 15:00:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 15:00:36,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:36,804 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:00:36,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:00:37,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (6)] Ended with exit code 0 [2024-11-13 15:00:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:00:37,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:37,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1343255813, now seen corresponding path program 1 times [2024-11-13 15:00:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328877027] [2024-11-13 15:00:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:37,207 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 15:00:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:37,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:00:37,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (8)] Waiting until timeout for monitored process [2024-11-13 15:00:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:37,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:00:37,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:38,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:00:40,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:00:41,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-13 15:00:43,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 15:00:45,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 15:00:47,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 51 [2024-11-13 15:00:53,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-11-13 15:00:53,552 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2024-11-13 15:00:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 87 [2024-11-13 15:00:57,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 95 [2024-11-13 15:01:11,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:01:11,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 100 [2024-11-13 15:01:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 123 proven. 64 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 15:01:11,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:42,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328877027] [2024-11-13 15:01:42,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328877027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455738278] [2024-11-13 15:01:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:42,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:42,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:42,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:42,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:01:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:42,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:01:42,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:44,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-13 15:01:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:01:44,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:01:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455738278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:01:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2024-11-13 15:01:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934954934] [2024-11-13 15:01:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=485, Unknown=11, NotChecked=0, Total=650 [2024-11-13 15:01:44,089 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:45,927 INFO L93 Difference]: Finished difference Result 246 states and 314 transitions. [2024-11-13 15:01:45,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:01:45,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-13 15:01:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:45,931 INFO L225 Difference]: With dead ends: 246 [2024-11-13 15:01:45,931 INFO L226 Difference]: Without dead ends: 143 [2024-11-13 15:01:45,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=166, Invalid=525, Unknown=11, NotChecked=0, Total=702 [2024-11-13 15:01:45,933 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 104 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:45,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 379 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 15:01:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-13 15:01:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2024-11-13 15:01:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 92 states have internal predecessors, (114), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2024-11-13 15:01:45,966 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 96 [2024-11-13 15:01:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2024-11-13 15:01:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2024-11-13 15:01:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 15:01:45,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:45,968 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:01:45,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:01:46,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (8)] Forceful destruction successful, exit code 0 [2024-11-13 15:01:46,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:46,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:46,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1328159340, now seen corresponding path program 1 times [2024-11-13 15:01:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823639807] [2024-11-13 15:01:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:46,370 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 15:01:46,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:46,372 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:46,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (10)] Waiting until timeout for monitored process [2024-11-13 15:01:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:46,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:01:46,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:01:46,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:01:46,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823639807] [2024-11-13 15:01:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823639807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:46,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861822925] [2024-11-13 15:01:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:46,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:46,658 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:46,727 INFO L93 Difference]: Finished difference Result 215 states and 272 transitions. [2024-11-13 15:01:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-13 15:01:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:46,729 INFO L225 Difference]: With dead ends: 215 [2024-11-13 15:01:46,729 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 15:01:46,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:46,731 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:46,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 15:01:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-13 15:01:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.25) internal successors, (115), 93 states have internal predecessors, (115), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2024-11-13 15:01:46,762 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 97 [2024-11-13 15:01:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:46,762 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2024-11-13 15:01:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2024-11-13 15:01:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 15:01:46,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:46,764 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:01:46,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (10)] Ended with exit code 0 [2024-11-13 15:01:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:46,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1069993902, now seen corresponding path program 1 times [2024-11-13 15:01:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000159871] [2024-11-13 15:01:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:46,965 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 15:01:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:46,967 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:46,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (11)] Waiting until timeout for monitored process [2024-11-13 15:01:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:47,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:01:47,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:01:47,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:01:47,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000159871] [2024-11-13 15:01:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000159871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:47,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:47,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:01:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77378733] [2024-11-13 15:01:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:47,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:01:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:01:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:47,327 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:47,448 INFO L93 Difference]: Finished difference Result 219 states and 276 transitions. [2024-11-13 15:01:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:01:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-13 15:01:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:47,451 INFO L225 Difference]: With dead ends: 219 [2024-11-13 15:01:47,451 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 15:01:47,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:47,451 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:47,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:01:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 15:01:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-13 15:01:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 94 states have internal predecessors, (116), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2024-11-13 15:01:47,479 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 97 [2024-11-13 15:01:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2024-11-13 15:01:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:01:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2024-11-13 15:01:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 15:01:47,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:47,481 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:01:47,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (11)] Ended with exit code 0 [2024-11-13 15:01:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:47,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -741353326, now seen corresponding path program 1 times [2024-11-13 15:01:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952110187] [2024-11-13 15:01:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:47,682 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 15:01:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:47,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:01:47,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (12)] Waiting until timeout for monitored process [2024-11-13 15:01:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:48,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:01:48,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:48,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:01:50,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:01:52,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:01:53,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:01:55,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:01:56,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 15:02:02,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 15:02:02,696 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-13 15:02:02,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 54 [2024-11-13 15:02:06,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2024-11-13 15:02:19,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:02:19,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 73 [2024-11-13 15:02:19,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:02:19,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 35 [2024-11-13 15:02:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 43 proven. 64 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 15:02:19,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:46,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952110187] [2024-11-13 15:02:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952110187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123209901] [2024-11-13 15:02:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:46,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:46,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:46,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:46,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:02:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:47,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:02:47,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:48,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-13 15:02:48,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 15:02:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:02:49,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:02:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123209901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:02:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-13 15:02:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824383994] [2024-11-13 15:02:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:49,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:02:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:02:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=344, Unknown=11, NotChecked=0, Total=462 [2024-11-13 15:02:49,574 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:02:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:51,105 INFO L93 Difference]: Finished difference Result 245 states and 307 transitions. [2024-11-13 15:02:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:02:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-13 15:02:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:51,108 INFO L225 Difference]: With dead ends: 245 [2024-11-13 15:02:51,108 INFO L226 Difference]: Without dead ends: 140 [2024-11-13 15:02:51,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=127, Invalid=414, Unknown=11, NotChecked=0, Total=552 [2024-11-13 15:02:51,109 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 127 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:51,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 261 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 15:02:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-13 15:02:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2024-11-13 15:02:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:02:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2024-11-13 15:02:51,142 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 97 [2024-11-13 15:02:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:51,142 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2024-11-13 15:02:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 15:02:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2024-11-13 15:02:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 15:02:51,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:51,144 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:51,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (12)] Forceful destruction successful, exit code 0 [2024-11-13 15:02:51,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:02:51,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:51,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:51,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 81714423, now seen corresponding path program 1 times [2024-11-13 15:02:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:51,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096850126] [2024-11-13 15:02:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:51,547 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 15:02:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:51,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 15:02:51,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/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 (14)] Waiting until timeout for monitored process [2024-11-13 15:02:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:52,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 15:02:52,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:58,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:02:59,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-13 15:03:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 15:03:05,597 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-13 15:03:05,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 54 [2024-11-13 15:03:05,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-11-13 15:03:14,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2024-11-13 15:03:23,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:03:23,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 52 [2024-11-13 15:03:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 15:03:23,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:34,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:03:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096850126] [2024-11-13 15:03:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096850126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834133734] [2024-11-13 15:03:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:34,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:34,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:34,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:34,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b09a56e3-33b7-4784-acb7-640bee5f3a38/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 15:03:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:34,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 15:03:34,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:54,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 15:04:15,390 INFO L349 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2024-11-13 15:04:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2024-11-13 15:04:27,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-13 15:04:52,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2024-11-13 15:05:13,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:05:13,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 44 [2024-11-13 15:05:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 15:05:13,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:05:15,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:05:15,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31578414 treesize of output 29071673 [2024-11-13 15:06:49,309 WARN L286 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 1695 DAG size of output: 505 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)