./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:07:51,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:07:51,243 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:07:51,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:07:51,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:07:51,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:07:51,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:07:51,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:07:51,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:07:51,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:07:51,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:07:51,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:07:51,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:07:51,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:07:51,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:07:51,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:07:51,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:07:51,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:07:51,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:07:51,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:07:51,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:07:51,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:07:51,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:07:51,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:07:51,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:51,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:07:51,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:07:51,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:07:51,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:07:51,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:07:51,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:07:51,326 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2024-11-13 14:07:51,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:07:51,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:07:51,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:07:51,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:07:51,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:07:51,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i Unable to find full path for "g++" [2024-11-13 14:07:54,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:07:54,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:07:54,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2024-11-13 14:07:54,749 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/76ff332b9/f3860cb927bc4e17a7699e587ecfe349/FLAGb1c46134e [2024-11-13 14:07:54,776 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/76ff332b9/f3860cb927bc4e17a7699e587ecfe349 [2024-11-13 14:07:54,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:07:54,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:07:54,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:54,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:07:54,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:07:54,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca8281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54, skipping insertion in model container [2024-11-13 14:07:54,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:07:55,030 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2024-11-13 14:07:55,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:55,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:07:55,167 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2024-11-13 14:07:55,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:55,267 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:07:55,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55 WrapperNode [2024-11-13 14:07:55,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:55,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:55,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:07:55,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:07:55,282 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:07:55" (1/1) ... [2024-11-13 14:07:55,309 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:07:55" (1/1) ... [2024-11-13 14:07:55,377 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 589 [2024-11-13 14:07:55,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:55,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:07:55,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:07:55,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:07:55,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,410 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 14:07:55,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:07:55,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:07:55,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:07:55,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:07:55,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (1/1) ... [2024-11-13 14:07:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:55,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:07:55,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:07:55,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:07:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:07:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 14:07:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 14:07:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 14:07:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 14:07:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 14:07:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 14:07:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:07:55,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:07:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 14:07:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:07:55,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:07:55,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:07:55,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:07:56,823 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-11-13 14:07:56,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:07:56,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:07:56,844 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:07:56,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:56 BoogieIcfgContainer [2024-11-13 14:07:56,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:07:56,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:07:56,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:07:56,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:07:56,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:07:54" (1/3) ... [2024-11-13 14:07:56,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1ecaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:56, skipping insertion in model container [2024-11-13 14:07:56,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:55" (2/3) ... [2024-11-13 14:07:56,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1ecaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:56, skipping insertion in model container [2024-11-13 14:07:56,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:56" (3/3) ... [2024-11-13 14:07:56,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2024-11-13 14:07:56,882 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:07:56,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:07:56,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:07:56,993 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;@54b62f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:07:56,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:07:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:07:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:07:57,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:57,022 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:57,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1871493712, now seen corresponding path program 1 times [2024-11-13 14:07:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083886062] [2024-11-13 14:07:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:07:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:07:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:07:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:07:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:07:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:07:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:07:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:07:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:07:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:07:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:07:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:07:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:07:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:07:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:07:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083886062] [2024-11-13 14:07:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083886062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:07:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467522174] [2024-11-13 14:07:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:07:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:07:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:07:57,880 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:07:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:57,916 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-11-13 14:07:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:07:57,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 14:07:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:57,928 INFO L225 Difference]: With dead ends: 239 [2024-11-13 14:07:57,928 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 14:07:57,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:07:57,937 INFO L432 NwaCegarLoop]: 171 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, 171 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:07:57,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:07:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 14:07:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 14:07:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:07:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-13 14:07:58,013 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2024-11-13 14:07:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:58,014 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-13 14:07:58,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:07:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-13 14:07:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:07:58,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:58,019 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:07:58,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1258522724, now seen corresponding path program 1 times [2024-11-13 14:07:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298469335] [2024-11-13 14:07:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:07:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:07:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:07:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:07:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:07:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:07:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:07:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:07:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:07:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:07:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:07:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:07:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:07:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:07:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:07:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298469335] [2024-11-13 14:07:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298469335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:07:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120488774] [2024-11-13 14:07:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:58,865 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:07:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:58,958 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2024-11-13 14:07:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 14:07:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:58,962 INFO L225 Difference]: With dead ends: 237 [2024-11-13 14:07:58,962 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 14:07:58,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:58,967 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:58,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:07:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 14:07:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-13 14:07:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:07:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-13 14:07:58,998 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2024-11-13 14:07:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:59,002 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-13 14:07:59,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:07:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-13 14:07:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:07:59,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:59,009 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:07:59,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:59,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 579250470, now seen corresponding path program 1 times [2024-11-13 14:07:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:59,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391786500] [2024-11-13 14:07:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:07:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:07:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:07:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:07:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:07:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:07:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:07:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:07:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:07:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:07:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:07:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:07:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:07:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:07:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:07:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391786500] [2024-11-13 14:07:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391786500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:07:59,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313708642] [2024-11-13 14:07:59,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:59,521 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:07:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:59,600 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2024-11-13 14:07:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-13 14:07:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:59,603 INFO L225 Difference]: With dead ends: 242 [2024-11-13 14:07:59,604 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 14:07:59,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:59,609 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:59,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:07:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 14:07:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-13 14:07:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:07:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-13 14:07:59,635 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2024-11-13 14:07:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-13 14:07:59,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:07:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-13 14:07:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:07:59,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:59,644 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:59,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:07:59,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1940709464, now seen corresponding path program 1 times [2024-11-13 14:07:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318540235] [2024-11-13 14:07:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:08:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:08:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:08:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:08:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:08:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:08:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:08:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:08:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:08:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:08:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:08:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:08:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:08:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:08:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:08:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318540235] [2024-11-13 14:08:02,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318540235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:02,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:02,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:08:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444760576] [2024-11-13 14:08:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:02,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:08:02,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:08:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:08:02,011 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:08:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:02,805 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2024-11-13 14:08:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:08:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-13 14:08:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:02,810 INFO L225 Difference]: With dead ends: 301 [2024-11-13 14:08:02,810 INFO L226 Difference]: Without dead ends: 181 [2024-11-13 14:08:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:08:02,816 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 291 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:02,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 557 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:08:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-13 14:08:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 140. [2024-11-13 14:08:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:08:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2024-11-13 14:08:02,849 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 130 [2024-11-13 14:08:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:02,850 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2024-11-13 14:08:02,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:08:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2024-11-13 14:08:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 14:08:02,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:02,857 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:02,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:08:02,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1381880237, now seen corresponding path program 1 times [2024-11-13 14:08:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121417015] [2024-11-13 14:08:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:08:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:08:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:08:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:08:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:08:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:08:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:08:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:08:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:08:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:08:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:08:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:08:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:08:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:08:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:08:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121417015] [2024-11-13 14:08:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121417015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:08:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753507666] [2024-11-13 14:08:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:08:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:08:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:08:06,729 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:08:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:08,666 INFO L93 Difference]: Finished difference Result 333 states and 475 transitions. [2024-11-13 14:08:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:08:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-11-13 14:08:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:08,671 INFO L225 Difference]: With dead ends: 333 [2024-11-13 14:08:08,671 INFO L226 Difference]: Without dead ends: 196 [2024-11-13 14:08:08,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:08:08,674 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 403 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:08,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 439 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:08:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-13 14:08:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 173. [2024-11-13 14:08:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.368421052631579) internal successors, (208), 153 states have internal predecessors, (208), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 14:08:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2024-11-13 14:08:08,740 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 244 transitions. Word has length 132 [2024-11-13 14:08:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 244 transitions. [2024-11-13 14:08:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:08:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 244 transitions. [2024-11-13 14:08:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:08:08,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:08,745 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:08:08,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -388611606, now seen corresponding path program 1 times [2024-11-13 14:08:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205065405] [2024-11-13 14:08:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:08:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:08:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:08:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:08:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:08:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:08:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:08:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:08:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:08:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:08:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:08:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:08:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:08:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:08:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:08:12,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205065405] [2024-11-13 14:08:12,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205065405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:12,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:12,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:08:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274109211] [2024-11-13 14:08:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:12,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:08:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:08:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:08:12,015 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 14:08:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:14,498 INFO L93 Difference]: Finished difference Result 347 states and 489 transitions. [2024-11-13 14:08:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:08:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2024-11-13 14:08:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:14,501 INFO L225 Difference]: With dead ends: 347 [2024-11-13 14:08:14,502 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 14:08:14,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:08:14,503 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 310 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:14,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 478 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:08:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 14:08:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 166. [2024-11-13 14:08:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:08:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 231 transitions. [2024-11-13 14:08:14,542 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 231 transitions. Word has length 134 [2024-11-13 14:08:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:14,543 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 231 transitions. [2024-11-13 14:08:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 14:08:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 231 transitions. [2024-11-13 14:08:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:08:14,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:14,548 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:08:14,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1912210984, now seen corresponding path program 1 times [2024-11-13 14:08:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639330218] [2024-11-13 14:08:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:08:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:08:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:08:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:08:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:08:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:08:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:08:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:08:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:08:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:08:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:08:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:08:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:08:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:08:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 14:08:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639330218] [2024-11-13 14:08:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639330218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94816254] [2024-11-13 14:08:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:21,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:21,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:21,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:08:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:22,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-13 14:08:22,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:24,609 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:08:26,287 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 14:08:27,369 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 14:08:28,331 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 14:08:29,025 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 14:08:29,731 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 14:08:30,584 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 14:08:31,940 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 76 treesize of output 63 [2024-11-13 14:08:31,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:31,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,001 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-13 14:08:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2024-11-13 14:08:32,065 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 54 treesize of output 41 [2024-11-13 14:08:32,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,108 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-13 14:08:32,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2024-11-13 14:08:32,158 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 57 treesize of output 44 [2024-11-13 14:08:32,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,204 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-13 14:08:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2024-11-13 14:08:32,880 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 96 treesize of output 70 [2024-11-13 14:08:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:32,914 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:08:32,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 108 [2024-11-13 14:08:33,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 16 [2024-11-13 14:08:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:08:34,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:08:34,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 151 treesize of output 219 [2024-11-13 14:08:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 87 proven. 123 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-13 14:08:39,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:08:39,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse1 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 0) (not (= v_ArrVal_828 (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse1))) (< (+ 128 .cse1) 0) (< 0 (+ .cse1 1))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse2 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 127 .cse2) (< .cse2 0) (< 0 (+ (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset) 2)) (not (= v_ArrVal_828 (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse2)))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse3 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 127 .cse3) (< .cse3 0) (< (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 0) (not (= v_ArrVal_828 (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse3)))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse4 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 0 (+ (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset) 2)) (not (= v_ArrVal_828 (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4))) (< (+ 128 .cse4) 0) (< 0 (+ .cse4 1))))))) is different from false [2024-11-13 14:08:44,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_825 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_825))) (store .cse4 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))))) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse1 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (not (= v_ArrVal_828 (store (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse1))) (< (+ 128 .cse1) 0) (< 0 (+ .cse1 1)) (< 0 (+ 2 (select (select (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (< (+ (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)) (+ (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1)) (not (= v_ArrVal_825 (store .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_825 c_~WrapperStruct00_var_1_11_Pointer~0.offset))))))) (forall ((v_ArrVal_825 (Array Int Int))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_825))) (store .cse8 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse8 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse7 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse7 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))))) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse5 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 127 .cse5) (< .cse5 0) (not (= v_ArrVal_828 (store (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse5))) (< 0 (+ 2 (select (select (store .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (< (+ (select (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)) (+ (select (select .cse6 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1)) (not (= v_ArrVal_825 (store .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_825 c_~WrapperStruct00_var_1_11_Pointer~0.offset))))))) (forall ((v_ArrVal_825 (Array Int Int))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_825))) (store .cse12 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse12 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse11 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))))) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse10 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< (select (select (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 0) (not (= v_ArrVal_828 (store (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse10))) (< (+ 128 .cse10) 0) (< 0 (+ .cse10 1))))) (< (+ (select (select .cse9 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse9 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)) (+ (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1)) (not (= v_ArrVal_825 (store .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_825 c_~WrapperStruct00_var_1_11_Pointer~0.offset))))))) (forall ((v_ArrVal_825 (Array Int Int))) (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_825))) (store .cse16 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse16 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse16 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse15 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse15 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))))) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse13 (select v_ArrVal_828 c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 127 .cse13) (< .cse13 0) (< (select (select (store .cse14 c_~WrapperStruct00_var_1_1_Pointer~0.base v_ArrVal_828) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 0) (not (= v_ArrVal_828 (store (select .cse14 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse13)))))) (< (+ (select (select .cse14 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse14 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)) (+ (select (select .cse14 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1)) (not (= v_ArrVal_825 (store .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_825 c_~WrapperStruct00_var_1_11_Pointer~0.offset))))))))) is different from false [2024-11-13 14:08:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94816254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:49,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:08:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2024-11-13 14:08:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559689386] [2024-11-13 14:08:49,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:08:49,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 14:08:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 14:08:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2024, Unknown=2, NotChecked=182, Total=2352 [2024-11-13 14:08:49,807 INFO L87 Difference]: Start difference. First operand 166 states and 231 transitions. Second operand has 38 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 38 states have internal predecessors, (136), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-11-13 14:09:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:02,935 INFO L93 Difference]: Finished difference Result 374 states and 522 transitions. [2024-11-13 14:09:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 14:09:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 38 states have internal predecessors, (136), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) Word has length 134 [2024-11-13 14:09:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:02,940 INFO L225 Difference]: With dead ends: 374 [2024-11-13 14:09:02,942 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 14:09:02,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=523, Invalid=3643, Unknown=2, NotChecked=254, Total=4422 [2024-11-13 14:09:02,945 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 394 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:02,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1959 Invalid, 3204 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-13 14:09:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 14:09:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2024-11-13 14:09:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 175 states have internal predecessors, (235), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:09:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2024-11-13 14:09:02,984 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 134 [2024-11-13 14:09:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2024-11-13 14:09:02,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 38 states have internal predecessors, (136), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-11-13 14:09:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2024-11-13 14:09:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:09:02,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:02,987 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:03,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:09:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:09:03,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash 358120172, now seen corresponding path program 1 times [2024-11-13 14:09:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458947264] [2024-11-13 14:09:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:09:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:09:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:09:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:09:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:09:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:09:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:09:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:09:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:09:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:09:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:09:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:09:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:09:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:09:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 14:09:04,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458947264] [2024-11-13 14:09:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458947264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934870425] [2024-11-13 14:09:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:04,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:04,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:09:04,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:09:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 14:09:04,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:05,377 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:09:05,707 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:09:05,935 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:09:06,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:09:06,257 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:09:06,470 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:09:06,581 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 15 treesize of output 7 [2024-11-13 14:09:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-13 14:09:06,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:09:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934870425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:06,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:09:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-11-13 14:09:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792476971] [2024-11-13 14:09:06,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:09:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:09:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:09:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:09:06,797 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 14:09:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:08,247 INFO L93 Difference]: Finished difference Result 356 states and 485 transitions. [2024-11-13 14:09:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:09:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 134 [2024-11-13 14:09:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:08,249 INFO L225 Difference]: With dead ends: 356 [2024-11-13 14:09:08,250 INFO L226 Difference]: Without dead ends: 180 [2024-11-13 14:09:08,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:09:08,251 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 257 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:08,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 807 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:09:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-13 14:09:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2024-11-13 14:09:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 155 states have internal predecessors, (206), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 14:09:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 242 transitions. [2024-11-13 14:09:08,289 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 242 transitions. Word has length 134 [2024-11-13 14:09:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:08,289 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 242 transitions. [2024-11-13 14:09:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 14:09:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 242 transitions. [2024-11-13 14:09:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:09:08,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:08,292 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:08,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:09:08,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:08,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1069069010, now seen corresponding path program 1 times [2024-11-13 14:09:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050433972] [2024-11-13 14:09:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:09:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:09:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:09:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:09:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:09:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:09:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:09:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:09:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:09:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:09:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:09:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:09:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:09:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:09:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:09:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050433972] [2024-11-13 14:09:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050433972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:09:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758471933] [2024-11-13 14:09:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:09:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:09:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:09:08,918 INFO L87 Difference]: Start difference. First operand 179 states and 242 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:09,327 INFO L93 Difference]: Finished difference Result 328 states and 446 transitions. [2024-11-13 14:09:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:09:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-13 14:09:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:09,333 INFO L225 Difference]: With dead ends: 328 [2024-11-13 14:09:09,334 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 14:09:09,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:09:09,335 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:09,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:09:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 14:09:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-13 14:09:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 155 states have internal predecessors, (204), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 14:09:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 240 transitions. [2024-11-13 14:09:09,379 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 240 transitions. Word has length 134 [2024-11-13 14:09:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 240 transitions. [2024-11-13 14:09:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 240 transitions. [2024-11-13 14:09:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:09:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:09,383 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:09:09,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -925075696, now seen corresponding path program 1 times [2024-11-13 14:09:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215854632] [2024-11-13 14:09:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:09:09,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:09:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:09:10,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:09:10,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:09:10,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:09:10,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:09:10,272 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:10,466 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:09:10,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:09:10 BoogieIcfgContainer [2024-11-13 14:09:10,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:09:10,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:09:10,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:09:10,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:09:10,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:56" (3/4) ... [2024-11-13 14:09:10,476 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:09:10,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:09:10,478 INFO L158 Benchmark]: Toolchain (without parser) took 75694.89ms. Allocated memory was 109.1MB in the beginning and 654.3MB in the end (delta: 545.3MB). Free memory was 81.8MB in the beginning and 566.9MB in the end (delta: -485.1MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-13 14:09:10,479 INFO L158 Benchmark]: CDTParser took 2.02ms. Allocated memory is still 83.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:10,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.84ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 65.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:09:10,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.22ms. Allocated memory is still 109.1MB. Free memory was 65.6MB in the beginning and 62.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:10,480 INFO L158 Benchmark]: Boogie Preprocessor took 103.21ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 58.9MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:09:10,480 INFO L158 Benchmark]: RCFGBuilder took 1362.98ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 66.1MB in the end (delta: -7.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-13 14:09:10,480 INFO L158 Benchmark]: TraceAbstraction took 73621.48ms. Allocated memory was 109.1MB in the beginning and 654.3MB in the end (delta: 545.3MB). Free memory was 65.6MB in the beginning and 567.0MB in the end (delta: -501.4MB). Peak memory consumption was 381.1MB. Max. memory is 16.1GB. [2024-11-13 14:09:10,481 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 654.3MB. Free memory was 567.0MB in the beginning and 566.9MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:10,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.02ms. Allocated memory is still 83.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.84ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 65.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.22ms. Allocated memory is still 109.1MB. Free memory was 65.6MB in the beginning and 62.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.21ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 58.9MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1362.98ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 66.1MB in the end (delta: -7.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 73621.48ms. Allocated memory was 109.1MB in the beginning and 654.3MB in the end (delta: 545.3MB). Free memory was 65.6MB in the beginning and 567.0MB in the end (delta: -501.4MB). Peak memory consumption was 381.1MB. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 654.3MB. Free memory was 567.0MB in the beginning and 566.9MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; [L57] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L70] signed short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L71] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L75] signed long int stepLocal_0 = -4; [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_0=-4] [L76] COND TRUE stepLocal_0 < (*(WrapperStruct00_var_1_6_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] (*(WrapperStruct00_var_1_11_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L82] COND TRUE ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] EXPR (*(WrapperStruct00_var_1_6_Pointer)) | 5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_6_Pointer)) | 5; [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] COND FALSE !(stepLocal_1 <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L91] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) [L122] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122-L123] return ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1656 mSDsluCounter, 5678 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4434 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5363 IncrementalHoareTripleChecker+Invalid, 5494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 1244 mSDtfsCounter, 5363 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 743 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=7, InterpolantAutomatonStates: 75, 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, 9 MinimizatonAttempts, 117 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 47.7s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1445 ConstructedInterpolants, 9 QuantifiedInterpolants, 18864 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1168 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 3704/4004 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:09:10,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:09:13,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:09:13,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:09:13,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:09:13,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:09:13,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:09:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:09:13,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:09:13,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:09:13,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:09:13,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:09:13,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:09:13,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:09:13,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:09:13,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:09:13,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:09:13,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:09:13,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:09:13,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:13,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:09:13,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:09:13,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:09:13,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:09:13,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:09:13,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:09:13,910 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2024-11-13 14:09:14,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:09:14,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:09:14,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:09:14,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:09:14,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:09:14,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i Unable to find full path for "g++" [2024-11-13 14:09:16,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:09:17,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:09:17,162 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2024-11-13 14:09:17,176 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/553c247ca/fd3d21a945aa42968e3b577070b72967/FLAG390d82ce5 [2024-11-13 14:09:17,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/data/553c247ca/fd3d21a945aa42968e3b577070b72967 [2024-11-13 14:09:17,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:09:17,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:09:17,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:17,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:09:17,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:09:17,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:17,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f90e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17, skipping insertion in model container [2024-11-13 14:09:17,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:17,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:09:17,497 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2024-11-13 14:09:17,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:17,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:09:17,692 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_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2024-11-13 14:09:17,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:17,852 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:09:17,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17 WrapperNode [2024-11-13 14:09:17,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:17,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:17,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:09:17,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:09:17,864 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:09:17" (1/1) ... [2024-11-13 14:09:17,899 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:09:17" (1/1) ... [2024-11-13 14:09:17,976 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 566 [2024-11-13 14:09:17,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:17,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:09:17,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:09:17,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:09:17,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:17,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,064 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-13 14:09:18,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:09:18,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:09:18,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:09:18,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:09:18,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (1/1) ... [2024-11-13 14:09:18,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:18,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:18,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:18,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:18,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:09:18,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:09:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:09:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:09:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:09:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:09:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:09:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:09:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:09:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 14:09:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 14:09:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-13 14:09:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 14:09:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 14:09:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:09:18,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:09:18,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:09:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 14:09:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 14:09:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:09:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:09:18,470 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:09:18,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:09:21,627 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-13 14:09:21,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:09:21,654 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:09:21,656 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:09:21,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:21 BoogieIcfgContainer [2024-11-13 14:09:21,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:09:21,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:09:21,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:09:21,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:09:21,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:09:17" (1/3) ... [2024-11-13 14:09:21,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b92424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:21, skipping insertion in model container [2024-11-13 14:09:21,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:17" (2/3) ... [2024-11-13 14:09:21,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b92424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:21, skipping insertion in model container [2024-11-13 14:09:21,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:21" (3/3) ... [2024-11-13 14:09:21,673 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2024-11-13 14:09:21,693 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:09:21,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:09:21,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:09:21,801 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;@61eff148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:09:21,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:09:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:09:21,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:21,821 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:21,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:21,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash 374720721, now seen corresponding path program 1 times [2024-11-13 14:09:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353433975] [2024-11-13 14:09:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:21,840 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:09:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:21,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:21,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:22,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:09:22,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-13 14:09:22,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:22,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:22,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353433975] [2024-11-13 14:09:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353433975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:22,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:09:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986301116] [2024-11-13 14:09:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:22,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:09:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:09:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:09:22,643 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:22,681 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-13 14:09:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:09:22,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-13 14:09:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:22,693 INFO L225 Difference]: With dead ends: 223 [2024-11-13 14:09:22,693 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 14:09:22,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:09:22,702 INFO L432 NwaCegarLoop]: 161 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, 161 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:09:22,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 14:09:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 14:09:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-13 14:09:22,789 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2024-11-13 14:09:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:22,790 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-13 14:09:22,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-13 14:09:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:09:22,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:22,797 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:22,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:22,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1402014693, now seen corresponding path program 1 times [2024-11-13 14:09:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933550063] [2024-11-13 14:09:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:23,000 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:09:23,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:23,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:23,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:23,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:09:23,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-13 14:09:23,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:23,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933550063] [2024-11-13 14:09:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933550063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:09:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272707248] [2024-11-13 14:09:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:09:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:09:23,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:09:23,789 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:23,902 INFO L93 Difference]: Finished difference Result 221 states and 322 transitions. [2024-11-13 14:09:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:09:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-13 14:09:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:23,908 INFO L225 Difference]: With dead ends: 221 [2024-11-13 14:09:23,908 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 14:09:23,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:09:23,914 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:23,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:09:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 14:09:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-13 14:09:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-13 14:09:23,942 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 128 [2024-11-13 14:09:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-13 14:09:23,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-13 14:09:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:09:23,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:23,953 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:23,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:24,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:24,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -599871577, now seen corresponding path program 1 times [2024-11-13 14:09:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295383449] [2024-11-13 14:09:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:24,159 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:09:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:24,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:24,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:24,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:09:24,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:09:24,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:24,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:24,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295383449] [2024-11-13 14:09:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295383449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:24,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:09:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589945954] [2024-11-13 14:09:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:24,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:09:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:09:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:09:24,969 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:25,155 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2024-11-13 14:09:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:09:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-13 14:09:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:25,161 INFO L225 Difference]: With dead ends: 230 [2024-11-13 14:09:25,162 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 14:09:25,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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:09:25,167 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:25,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:09:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 14:09:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-13 14:09:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-11-13 14:09:25,192 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 128 [2024-11-13 14:09:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:25,193 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-11-13 14:09:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-11-13 14:09:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:09:25,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:25,201 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:25,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:25,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1175135785, now seen corresponding path program 1 times [2024-11-13 14:09:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090465325] [2024-11-13 14:09:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:25,404 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:09:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:25,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:25,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:26,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:09:26,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:09:26,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:26,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090465325] [2024-11-13 14:09:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090465325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:09:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636962833] [2024-11-13 14:09:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:09:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:09:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:09:26,215 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:26,398 INFO L93 Difference]: Finished difference Result 238 states and 339 transitions. [2024-11-13 14:09:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:09:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-13 14:09:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:26,403 INFO L225 Difference]: With dead ends: 238 [2024-11-13 14:09:26,405 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 14:09:26,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:09:26,407 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:26,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 892 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:09:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 14:09:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-13 14:09:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2024-11-13 14:09:26,419 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 128 [2024-11-13 14:09:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2024-11-13 14:09:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2024-11-13 14:09:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:09:26,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:26,424 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:26,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:09:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:26,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1176982827, now seen corresponding path program 1 times [2024-11-13 14:09:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:26,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711611166] [2024-11-13 14:09:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:26,631 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:09:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:26,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:26,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:27,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:09:27,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:27,413 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 95 treesize of output 41 [2024-11-13 14:09:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:09:27,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:27,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711611166] [2024-11-13 14:09:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711611166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:09:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178817419] [2024-11-13 14:09:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:09:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:09:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:09:27,472 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:28,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:09:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:30,274 INFO L93 Difference]: Finished difference Result 240 states and 340 transitions. [2024-11-13 14:09:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:09:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-13 14:09:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:30,276 INFO L225 Difference]: With dead ends: 240 [2024-11-13 14:09:30,277 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 14:09:30,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:09:30,278 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:30,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 461 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 14:09:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 14:09:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-13 14:09:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-11-13 14:09:30,288 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 128 [2024-11-13 14:09:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:30,288 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-11-13 14:09:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-11-13 14:09:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:09:30,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:30,290 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:30,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:09:30,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:30,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:30,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:30,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1859493649, now seen corresponding path program 1 times [2024-11-13 14:09:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:30,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846001867] [2024-11-13 14:09:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:30,493 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:09:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:30,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:30,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 (7)] Waiting until timeout for monitored process [2024-11-13 14:09:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:31,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:09:31,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:31,239 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 95 treesize of output 41 [2024-11-13 14:09:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-13 14:09:31,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:31,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846001867] [2024-11-13 14:09:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846001867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:09:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026150664] [2024-11-13 14:09:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:09:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:09:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:09:31,293 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:32,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:09:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:33,983 INFO L93 Difference]: Finished difference Result 239 states and 337 transitions. [2024-11-13 14:09:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:09:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 14:09:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:33,987 INFO L225 Difference]: With dead ends: 239 [2024-11-13 14:09:33,987 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 14:09:33,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:09:33,991 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:33,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 456 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 14:09:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 14:09:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-11-13 14:09:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2024-11-13 14:09:34,009 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 130 [2024-11-13 14:09:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2024-11-13 14:09:34,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:09:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2024-11-13 14:09:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 14:09:34,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:34,016 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:34,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 (7)] Ended with exit code 0 [2024-11-13 14:09:34,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:34,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:34,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2020041385, now seen corresponding path program 1 times [2024-11-13 14:09:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913600207] [2024-11-13 14:09:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:34,218 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:09:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:34,220 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:34,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 14:09:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:34,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:09:34,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:35,110 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 94 treesize of output 40 [2024-11-13 14:09:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:09:35,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:09:35,710 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 58 treesize of output 22 [2024-11-13 14:09:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 14:09:35,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913600207] [2024-11-13 14:09:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913600207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:09:35,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:09:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-13 14:09:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565972872] [2024-11-13 14:09:35,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:09:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:09:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:35,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:09:35,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:09:35,730 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-13 14:09:37,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:09:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:40,604 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2024-11-13 14:09:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:09:40,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 132 [2024-11-13 14:09:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:40,606 INFO L225 Difference]: With dead ends: 246 [2024-11-13 14:09:40,606 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 14:09:40,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:09:40,608 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:40,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 570 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-13 14:09:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 14:09:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 14:09:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2024-11-13 14:09:40,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 132 [2024-11-13 14:09:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:40,617 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2024-11-13 14:09:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-13 14:09:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2024-11-13 14:09:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 14:09:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:40,619 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:40,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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)] Ended with exit code 0 [2024-11-13 14:09:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:40,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1942282773, now seen corresponding path program 1 times [2024-11-13 14:09:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805320424] [2024-11-13 14:09:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:40,821 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:09:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:40,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:40,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 (9)] Waiting until timeout for monitored process [2024-11-13 14:09:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:41,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:09:41,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:41,467 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:09:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:09:41,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:41,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805320424] [2024-11-13 14:09:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805320424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:09:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998390343] [2024-11-13 14:09:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:09:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:09:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:09:41,513 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:41,561 INFO L93 Difference]: Finished difference Result 235 states and 327 transitions. [2024-11-13 14:09:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:09:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-13 14:09:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:41,566 INFO L225 Difference]: With dead ends: 235 [2024-11-13 14:09:41,567 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 14:09:41,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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:09:41,568 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 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:09:41,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 14:09:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 14:09:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:09:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 164 transitions. [2024-11-13 14:09:41,588 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 164 transitions. Word has length 132 [2024-11-13 14:09:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:41,588 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 164 transitions. [2024-11-13 14:09:41,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 14:09:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 164 transitions. [2024-11-13 14:09:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 14:09:41,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:41,594 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:41,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 (9)] Ended with exit code 0 [2024-11-13 14:09:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:41,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 358539817, now seen corresponding path program 1 times [2024-11-13 14:09:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096624060] [2024-11-13 14:09:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:41,796 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:09:41,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:41,798 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:09:41,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 14:09:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:42,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:09:42,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:43,322 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 12 treesize of output 8 [2024-11-13 14:09:43,961 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 30 treesize of output 25 [2024-11-13 14:09:44,602 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 32 treesize of output 23 [2024-11-13 14:09:44,989 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 32 treesize of output 23 [2024-11-13 14:09:45,435 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 32 treesize of output 23 [2024-11-13 14:09:45,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:45,949 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 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 14:09:46,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:46,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 14:09:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 159 proven. 117 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 14:09:46,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:09:46,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096624060] [2024-11-13 14:09:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096624060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964902790] [2024-11-13 14:09:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:46,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:09:46,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:09:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:46,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:09:46,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:47,596 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 12 treesize of output 8 [2024-11-13 14:09:47,978 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 33 treesize of output 17 [2024-11-13 14:09:48,349 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 33 treesize of output 17 [2024-11-13 14:09:48,619 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 33 treesize of output 17 [2024-11-13 14:09:48,936 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 33 treesize of output 17 [2024-11-13 14:09:49,288 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 33 treesize of output 17 [2024-11-13 14:09:49,577 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:09:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 135 proven. 117 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-13 14:09:49,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:09:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964902790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:49,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:09:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2024-11-13 14:09:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659524074] [2024-11-13 14:09:49,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:09:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:09:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:09:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:09:49,748 INFO L87 Difference]: Start difference. First operand 119 states and 164 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-13 14:09:51,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:52,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:54,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:56,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:59,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:10:01,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:10:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:04,353 INFO L93 Difference]: Finished difference Result 267 states and 360 transitions. [2024-11-13 14:10:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:10:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 132 [2024-11-13 14:10:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:04,356 INFO L225 Difference]: With dead ends: 267 [2024-11-13 14:10:04,356 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 14:10:04,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:10:04,358 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 175 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:04,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 349 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-13 14:10:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 14:10:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-13 14:10:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 128 states have internal predecessors, (161), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 14:10:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2024-11-13 14:10:04,375 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 132 [2024-11-13 14:10:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:04,376 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2024-11-13 14:10:04,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-13 14:10:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2024-11-13 14:10:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:10:04,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:04,378 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 14:10:04,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:10:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:10:04,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 175245518, now seen corresponding path program 1 times [2024-11-13 14:10:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:10:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527660447] [2024-11-13 14:10:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:04,785 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:10:04,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:10:04,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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:10:04,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e8e0e6-ff68-48b0-8563-bf2c84ca002a/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 14:10:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:05,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 14:10:05,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:09,051 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:10:11,422 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 14:10:13,453 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 14:10:15,228 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 14:10:16,622 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 14:10:17,996 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 14:10:19,758 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 14:10:21,860 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 14:10:22,260 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 70 treesize of output 57 [2024-11-13 14:10:22,484 INFO L349 Elim1Store]: treesize reduction 201, result has 6.9 percent of original size [2024-11-13 14:10:22,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 164 treesize of output 241 [2024-11-13 14:10:23,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 69 treesize of output 42 [2024-11-13 14:10:23,728 INFO L349 Elim1Store]: treesize reduction 28, result has 36.4 percent of original size [2024-11-13 14:10:23,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 70 [2024-11-13 14:10:23,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 78 treesize of output 45 [2024-11-13 14:10:24,451 INFO L349 Elim1Store]: treesize reduction 108, result has 22.3 percent of original size [2024-11-13 14:10:24,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 256 treesize of output 205 [2024-11-13 14:10:59,553 WARN L286 SmtUtils]: Spent 28.29s on a formula simplification. DAG size of input: 1123 DAG size of output: 651 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 14:10:59,554 INFO L349 Elim1Store]: treesize reduction 1088, result has 54.0 percent of original size [2024-11-13 14:10:59,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 21 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 255 case distinctions, treesize of input 918 treesize of output 1800