./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX --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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:32:57,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:32:57,099 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:32:57,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:32:57,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:32:57,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:32:57,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:32:57,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:32:57,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:32:57,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:32:57,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:32:57,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:32:57,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:32:57,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:32:57,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:32:57,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:32:57,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:32:57,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:32:57,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:32:57,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:32:57,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:32:57,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:32:57,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:32:57,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:32:57,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:32:57,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:32:57,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:32:57,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:32:57,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:32:57,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:32:57,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:32:57,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:32:57,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:32:57,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:32:57,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:32:57,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:32:57,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:32:57,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:32:57,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:32:57,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:32:57,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:32:57,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:32:57,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2024-11-08 18:32:57,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:32:57,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:32:57,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:32:57,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:32:57,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:32:57,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i Unable to find full path for "g++" [2024-11-08 18:32:59,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:32:59,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:32:59,742 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-08 18:32:59,752 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/39c76461c/79cd18cc1801436db7b39710d3279a34/FLAG0f119b8f2 [2024-11-08 18:33:00,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/39c76461c/79cd18cc1801436db7b39710d3279a34 [2024-11-08 18:33:00,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:33:00,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:33:00,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:33:00,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:33:00,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:33:00,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6392012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00, skipping insertion in model container [2024-11-08 18:33:00,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:33:00,295 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_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-08 18:33:00,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:33:00,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:33:00,454 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_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-08 18:33:00,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:33:00,556 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:33:00,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00 WrapperNode [2024-11-08 18:33:00,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:33:00,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:33:00,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:33:00,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:33:00,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,656 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 640 [2024-11-08 18:33:00,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:33:00,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:33:00,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:33:00,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:33:00,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,693 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 18:33:00,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:33:00,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:33:00,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:33:00,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:33:00,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (1/1) ... [2024-11-08 18:33:00,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:33:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:00,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:33:00,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:33:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:33:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 18:33:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 18:33:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 18:33:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 18:33:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 18:33:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 18:33:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:33:00,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:33:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 18:33:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:33:00,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:33:00,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:33:00,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:33:01,826 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-08 18:33:01,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:33:01,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:33:01,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:33:01,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:33:01 BoogieIcfgContainer [2024-11-08 18:33:01,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:33:01,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:33:01,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:33:01,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:33:01,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:33:00" (1/3) ... [2024-11-08 18:33:01,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1248599d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:33:01, skipping insertion in model container [2024-11-08 18:33:01,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:00" (2/3) ... [2024-11-08 18:33:01,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1248599d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:33:01, skipping insertion in model container [2024-11-08 18:33:01,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:33:01" (3/3) ... [2024-11-08 18:33:01,854 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-08 18:33:01,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:33:01,903 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:33:01,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:33:02,002 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;@4f77c393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:33:02,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:33:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:33:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:33:02,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:02,024 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:02,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:02,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -260688339, now seen corresponding path program 1 times [2024-11-08 18:33:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235509644] [2024-11-08 18:33:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235509644] [2024-11-08 18:33:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235509644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:33:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880288485] [2024-11-08 18:33:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:33:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:33:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:33:02,572 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:02,621 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-08 18:33:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:33:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-08 18:33:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:02,640 INFO L225 Difference]: With dead ends: 291 [2024-11-08 18:33:02,640 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 18:33:02,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-08 18:33:02,650 INFO L432 NwaCegarLoop]: 215 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, 215 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-08 18:33:02,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 18:33:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-08 18:33:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:33:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-08 18:33:02,715 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-08 18:33:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:02,716 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-08 18:33:02,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-08 18:33:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:33:02,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:02,723 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:02,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:33:02,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1985849963, now seen corresponding path program 1 times [2024-11-08 18:33:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605907768] [2024-11-08 18:33:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:03,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605907768] [2024-11-08 18:33:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605907768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:03,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:03,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:33:03,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976576781] [2024-11-08 18:33:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:03,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:33:03,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:03,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:33:03,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:33:03,307 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:03,367 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-08 18:33:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:33:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-08 18:33:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:03,370 INFO L225 Difference]: With dead ends: 289 [2024-11-08 18:33:03,370 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 18:33:03,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-08 18:33:03,372 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-08 18:33:03,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 18:33:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-08 18:33:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:33:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-08 18:33:03,388 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-08 18:33:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:03,390 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-08 18:33:03,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-08 18:33:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:33:03,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:03,393 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:03,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:33:03,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1632761581, now seen corresponding path program 1 times [2024-11-08 18:33:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984161338] [2024-11-08 18:33:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:03,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:03,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984161338] [2024-11-08 18:33:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984161338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:33:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025990222] [2024-11-08 18:33:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:33:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:33:03,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:33:03,878 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:03,941 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-08 18:33:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:33:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 18:33:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:03,945 INFO L225 Difference]: With dead ends: 293 [2024-11-08 18:33:03,948 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 18:33:03,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-08 18:33:03,951 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-08 18:33:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 18:33:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-08 18:33:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:33:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-08 18:33:03,979 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 133 [2024-11-08 18:33:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-08 18:33:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-08 18:33:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 18:33:03,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:03,989 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:03,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:33:03,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash -792916411, now seen corresponding path program 1 times [2024-11-08 18:33:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958986719] [2024-11-08 18:33:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958986719] [2024-11-08 18:33:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958986719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:33:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206179921] [2024-11-08 18:33:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:04,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:33:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:33:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:33:04,295 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:04,340 INFO L93 Difference]: Finished difference Result 372 states and 550 transitions. [2024-11-08 18:33:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:33:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-08 18:33:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:04,344 INFO L225 Difference]: With dead ends: 372 [2024-11-08 18:33:04,344 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 18:33:04,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-08 18:33:04,346 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:04,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 18:33:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2024-11-08 18:33:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:33:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-11-08 18:33:04,371 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 135 [2024-11-08 18:33:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-11-08 18:33:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-11-08 18:33:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 18:33:04,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:04,379 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:04,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:33:04,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1970797938, now seen corresponding path program 1 times [2024-11-08 18:33:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937900318] [2024-11-08 18:33:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937900318] [2024-11-08 18:33:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937900318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:33:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539863412] [2024-11-08 18:33:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:06,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:33:06,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:33:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:06,645 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:06,945 INFO L93 Difference]: Finished difference Result 442 states and 656 transitions. [2024-11-08 18:33:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:33:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-08 18:33:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:06,950 INFO L225 Difference]: With dead ends: 442 [2024-11-08 18:33:06,952 INFO L226 Difference]: Without dead ends: 264 [2024-11-08 18:33:06,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:33:06,954 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:06,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 655 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:33:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-08 18:33:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2024-11-08 18:33:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 217 states have (on average 1.4101382488479262) internal successors, (306), 217 states have internal predecessors, (306), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 18:33:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 370 transitions. [2024-11-08 18:33:06,994 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 370 transitions. Word has length 135 [2024-11-08 18:33:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:06,995 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 370 transitions. [2024-11-08 18:33:06,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 370 transitions. [2024-11-08 18:33:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 18:33:06,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:06,998 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:06,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:33:07,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 267213225, now seen corresponding path program 1 times [2024-11-08 18:33:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866000918] [2024-11-08 18:33:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 18:33:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866000918] [2024-11-08 18:33:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866000918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:33:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237798259] [2024-11-08 18:33:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:08,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:08,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:33:08,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:33:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:33:09,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:12,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,240 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 21 treesize of output 24 [2024-11-08 18:33:12,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:33:12,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-11-08 18:33:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:12,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:33:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237798259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:12,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:33:12,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2024-11-08 18:33:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719257714] [2024-11-08 18:33:12,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:12,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:33:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:33:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:33:12,747 INFO L87 Difference]: Start difference. First operand 252 states and 370 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:13,386 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2024-11-08 18:33:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:33:13,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 18:33:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:13,389 INFO L225 Difference]: With dead ends: 530 [2024-11-08 18:33:13,389 INFO L226 Difference]: Without dead ends: 352 [2024-11-08 18:33:13,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:33:13,391 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 413 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:13,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1112 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:33:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-08 18:33:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 310. [2024-11-08 18:33:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 275 states have (on average 1.4290909090909092) internal successors, (393), 275 states have internal predecessors, (393), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 18:33:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 457 transitions. [2024-11-08 18:33:13,426 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 457 transitions. Word has length 136 [2024-11-08 18:33:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:13,428 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 457 transitions. [2024-11-08 18:33:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 457 transitions. [2024-11-08 18:33:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 18:33:13,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:13,433 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:13,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:33:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:13,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1873523092, now seen corresponding path program 1 times [2024-11-08 18:33:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987792496] [2024-11-08 18:33:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987792496] [2024-11-08 18:33:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987792496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:33:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423120638] [2024-11-08 18:33:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:33:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:33:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:33:15,712 INFO L87 Difference]: Start difference. First operand 310 states and 457 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:16,168 INFO L93 Difference]: Finished difference Result 779 states and 1158 transitions. [2024-11-08 18:33:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:33:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-11-08 18:33:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:16,174 INFO L225 Difference]: With dead ends: 779 [2024-11-08 18:33:16,174 INFO L226 Difference]: Without dead ends: 543 [2024-11-08 18:33:16,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:33:16,176 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 163 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:16,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 980 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:33:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-08 18:33:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 478. [2024-11-08 18:33:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 426 states have (on average 1.4342723004694835) internal successors, (611), 426 states have internal predecessors, (611), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 707 transitions. [2024-11-08 18:33:16,242 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 707 transitions. Word has length 137 [2024-11-08 18:33:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:16,243 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 707 transitions. [2024-11-08 18:33:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 707 transitions. [2024-11-08 18:33:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 18:33:16,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:16,248 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:16,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:33:16,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 967736748, now seen corresponding path program 1 times [2024-11-08 18:33:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875690645] [2024-11-08 18:33:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875690645] [2024-11-08 18:33:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875690645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:33:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520366732] [2024-11-08 18:33:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:33:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:33:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:16,521 INFO L87 Difference]: Start difference. First operand 478 states and 707 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:16,582 INFO L93 Difference]: Finished difference Result 891 states and 1321 transitions. [2024-11-08 18:33:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:33:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 18:33:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:16,585 INFO L225 Difference]: With dead ends: 891 [2024-11-08 18:33:16,587 INFO L226 Difference]: Without dead ends: 487 [2024-11-08 18:33:16,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:16,588 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:16,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-08 18:33:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2024-11-08 18:33:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.4312354312354312) internal successors, (614), 429 states have internal predecessors, (614), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 710 transitions. [2024-11-08 18:33:16,634 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 710 transitions. Word has length 137 [2024-11-08 18:33:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:16,635 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 710 transitions. [2024-11-08 18:33:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 710 transitions. [2024-11-08 18:33:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 18:33:16,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:16,637 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:33:16,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:16,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -650461132, now seen corresponding path program 1 times [2024-11-08 18:33:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893528982] [2024-11-08 18:33:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:16,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893528982] [2024-11-08 18:33:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893528982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:33:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333486356] [2024-11-08 18:33:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:33:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:33:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:16,936 INFO L87 Difference]: Start difference. First operand 481 states and 710 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:16,997 INFO L93 Difference]: Finished difference Result 894 states and 1323 transitions. [2024-11-08 18:33:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:33:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-08 18:33:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:17,001 INFO L225 Difference]: With dead ends: 894 [2024-11-08 18:33:17,001 INFO L226 Difference]: Without dead ends: 487 [2024-11-08 18:33:17,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:17,004 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:17,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-08 18:33:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-11-08 18:33:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 435 states have (on average 1.4252873563218391) internal successors, (620), 435 states have internal predecessors, (620), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 716 transitions. [2024-11-08 18:33:17,044 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 716 transitions. Word has length 138 [2024-11-08 18:33:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:17,045 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 716 transitions. [2024-11-08 18:33:17,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 716 transitions. [2024-11-08 18:33:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 18:33:17,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:17,047 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:33:17,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash 538756611, now seen corresponding path program 1 times [2024-11-08 18:33:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135748799] [2024-11-08 18:33:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:18,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:18,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135748799] [2024-11-08 18:33:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135748799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:18,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:33:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257109859] [2024-11-08 18:33:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:18,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:33:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:33:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:33:18,220 INFO L87 Difference]: Start difference. First operand 487 states and 716 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:18,939 INFO L93 Difference]: Finished difference Result 938 states and 1380 transitions. [2024-11-08 18:33:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:33:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-08 18:33:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:18,943 INFO L225 Difference]: With dead ends: 938 [2024-11-08 18:33:18,943 INFO L226 Difference]: Without dead ends: 697 [2024-11-08 18:33:18,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:33:18,944 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 525 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:18,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 861 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:33:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-08 18:33:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 547. [2024-11-08 18:33:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 495 states have (on average 1.4343434343434343) internal successors, (710), 495 states have internal predecessors, (710), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 806 transitions. [2024-11-08 18:33:19,002 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 806 transitions. Word has length 138 [2024-11-08 18:33:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 806 transitions. [2024-11-08 18:33:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 806 transitions. [2024-11-08 18:33:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 18:33:19,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:19,005 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:33:19,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:19,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 823635439, now seen corresponding path program 1 times [2024-11-08 18:33:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39396329] [2024-11-08 18:33:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:20,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39396329] [2024-11-08 18:33:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39396329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:33:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877963411] [2024-11-08 18:33:20,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:20,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:33:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:20,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:33:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:33:20,043 INFO L87 Difference]: Start difference. First operand 547 states and 806 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:20,597 INFO L93 Difference]: Finished difference Result 998 states and 1469 transitions. [2024-11-08 18:33:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:33:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-08 18:33:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:20,602 INFO L225 Difference]: With dead ends: 998 [2024-11-08 18:33:20,602 INFO L226 Difference]: Without dead ends: 697 [2024-11-08 18:33:20,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:33:20,606 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 566 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:20,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 965 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:33:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-08 18:33:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 607. [2024-11-08 18:33:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 555 states have (on average 1.4414414414414414) internal successors, (800), 555 states have internal predecessors, (800), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 896 transitions. [2024-11-08 18:33:20,652 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 896 transitions. Word has length 138 [2024-11-08 18:33:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:20,653 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 896 transitions. [2024-11-08 18:33:20,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 896 transitions. [2024-11-08 18:33:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 18:33:20,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:20,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:33:20,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:20,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1985687762, now seen corresponding path program 1 times [2024-11-08 18:33:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198100226] [2024-11-08 18:33:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:24,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198100226] [2024-11-08 18:33:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198100226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:33:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619698122] [2024-11-08 18:33:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:33:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:33:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:33:24,973 INFO L87 Difference]: Start difference. First operand 607 states and 896 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:27,314 INFO L93 Difference]: Finished difference Result 1410 states and 2081 transitions. [2024-11-08 18:33:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:33:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-08 18:33:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:27,319 INFO L225 Difference]: With dead ends: 1410 [2024-11-08 18:33:27,319 INFO L226 Difference]: Without dead ends: 877 [2024-11-08 18:33:27,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-08 18:33:27,321 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 293 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:27,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2135 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:33:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-08 18:33:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 788. [2024-11-08 18:33:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 736 states have (on average 1.451086956521739) internal successors, (1068), 736 states have internal predecessors, (1068), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:33:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1164 transitions. [2024-11-08 18:33:27,420 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1164 transitions. Word has length 139 [2024-11-08 18:33:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1164 transitions. [2024-11-08 18:33:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1164 transitions. [2024-11-08 18:33:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 18:33:27,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:27,427 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:33:27,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1284623184, now seen corresponding path program 1 times [2024-11-08 18:33:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540178123] [2024-11-08 18:33:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:27,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540178123] [2024-11-08 18:33:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540178123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:33:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502261939] [2024-11-08 18:33:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:33:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:33:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:33:28,750 INFO L87 Difference]: Start difference. First operand 788 states and 1164 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:29,594 INFO L93 Difference]: Finished difference Result 1632 states and 2401 transitions. [2024-11-08 18:33:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:33:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-08 18:33:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:29,599 INFO L225 Difference]: With dead ends: 1632 [2024-11-08 18:33:29,599 INFO L226 Difference]: Without dead ends: 918 [2024-11-08 18:33:29,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:33:29,601 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 439 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:29,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 891 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:33:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-08 18:33:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 914. [2024-11-08 18:33:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 843 states have (on average 1.4341637010676156) internal successors, (1209), 845 states have internal predecessors, (1209), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:33:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1337 transitions. [2024-11-08 18:33:29,684 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1337 transitions. Word has length 139 [2024-11-08 18:33:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:29,685 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1337 transitions. [2024-11-08 18:33:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1337 transitions. [2024-11-08 18:33:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 18:33:29,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:29,688 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:29,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:33:29,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:29,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1491631084, now seen corresponding path program 1 times [2024-11-08 18:33:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:29,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487468513] [2024-11-08 18:33:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487468513] [2024-11-08 18:33:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487468513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:33:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363748642] [2024-11-08 18:33:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:30,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:33:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:33:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:33:30,799 INFO L87 Difference]: Start difference. First operand 914 states and 1337 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:31,632 INFO L93 Difference]: Finished difference Result 1934 states and 2829 transitions. [2024-11-08 18:33:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:33:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-08 18:33:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:31,639 INFO L225 Difference]: With dead ends: 1934 [2024-11-08 18:33:31,639 INFO L226 Difference]: Without dead ends: 1098 [2024-11-08 18:33:31,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:33:31,641 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 290 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:31,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 967 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:33:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-08 18:33:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 975. [2024-11-08 18:33:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 904 states have (on average 1.4358407079646018) internal successors, (1298), 906 states have internal predecessors, (1298), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:33:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1426 transitions. [2024-11-08 18:33:31,726 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1426 transitions. Word has length 139 [2024-11-08 18:33:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:31,726 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1426 transitions. [2024-11-08 18:33:31,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1426 transitions. [2024-11-08 18:33:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 18:33:31,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:31,729 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:31,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:33:31,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2102271634, now seen corresponding path program 1 times [2024-11-08 18:33:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717195403] [2024-11-08 18:33:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717195403] [2024-11-08 18:33:35,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717195403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:35,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:33:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696497711] [2024-11-08 18:33:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:35,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:33:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:33:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:33:35,328 INFO L87 Difference]: Start difference. First operand 975 states and 1426 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:37,434 INFO L93 Difference]: Finished difference Result 1960 states and 2869 transitions. [2024-11-08 18:33:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:33:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-08 18:33:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:37,439 INFO L225 Difference]: With dead ends: 1960 [2024-11-08 18:33:37,440 INFO L226 Difference]: Without dead ends: 1063 [2024-11-08 18:33:37,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-08 18:33:37,445 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 423 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:37,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2196 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:33:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-08 18:33:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 972. [2024-11-08 18:33:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 901 states have (on average 1.437291897891232) internal successors, (1295), 903 states have internal predecessors, (1295), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:33:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1423 transitions. [2024-11-08 18:33:37,538 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1423 transitions. Word has length 139 [2024-11-08 18:33:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:37,539 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1423 transitions. [2024-11-08 18:33:37,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1423 transitions. [2024-11-08 18:33:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 18:33:37,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:37,543 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:37,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:33:37,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:37,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 559649617, now seen corresponding path program 1 times [2024-11-08 18:33:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:37,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987579461] [2024-11-08 18:33:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987579461] [2024-11-08 18:33:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987579461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:37,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:33:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136066974] [2024-11-08 18:33:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:37,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:33:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:33:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:33:37,674 INFO L87 Difference]: Start difference. First operand 972 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:37,863 INFO L93 Difference]: Finished difference Result 2022 states and 2949 transitions. [2024-11-08 18:33:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:33:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-08 18:33:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:37,868 INFO L225 Difference]: With dead ends: 2022 [2024-11-08 18:33:37,869 INFO L226 Difference]: Without dead ends: 1128 [2024-11-08 18:33:37,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-08 18:33:37,871 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 104 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:37,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:33:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-08 18:33:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 923. [2024-11-08 18:33:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 852 states have (on average 1.414319248826291) internal successors, (1205), 854 states have internal predecessors, (1205), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:33:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1333 transitions. [2024-11-08 18:33:37,959 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1333 transitions. Word has length 139 [2024-11-08 18:33:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:37,960 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1333 transitions. [2024-11-08 18:33:37,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:33:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1333 transitions. [2024-11-08 18:33:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 18:33:37,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:37,962 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:37,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:33:37,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash 311606361, now seen corresponding path program 1 times [2024-11-08 18:33:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337031135] [2024-11-08 18:33:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337031135] [2024-11-08 18:33:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337031135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:33:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597189703] [2024-11-08 18:33:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:33:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:33:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:33:40,606 INFO L87 Difference]: Start difference. First operand 923 states and 1333 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 18:33:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:42,415 INFO L93 Difference]: Finished difference Result 1550 states and 2238 transitions. [2024-11-08 18:33:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:33:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2024-11-08 18:33:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:42,419 INFO L225 Difference]: With dead ends: 1550 [2024-11-08 18:33:42,420 INFO L226 Difference]: Without dead ends: 1039 [2024-11-08 18:33:42,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:33:42,422 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 768 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:42,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1459 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:33:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-08 18:33:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1027. [2024-11-08 18:33:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 953 states have (on average 1.415529905561385) internal successors, (1349), 956 states have internal predecessors, (1349), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 18:33:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1481 transitions. [2024-11-08 18:33:42,521 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1481 transitions. Word has length 140 [2024-11-08 18:33:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:42,522 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1481 transitions. [2024-11-08 18:33:42,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 18:33:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1481 transitions. [2024-11-08 18:33:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 18:33:42,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:42,525 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:42,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:33:42,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:42,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1146259715, now seen corresponding path program 1 times [2024-11-08 18:33:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:42,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341658105] [2024-11-08 18:33:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:33:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341658105] [2024-11-08 18:33:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341658105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:33:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694814295] [2024-11-08 18:33:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:44,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:33:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:33:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:33:44,866 INFO L87 Difference]: Start difference. First operand 1027 states and 1481 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:45,678 INFO L93 Difference]: Finished difference Result 1723 states and 2486 transitions. [2024-11-08 18:33:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:33:45,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-08 18:33:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:45,683 INFO L225 Difference]: With dead ends: 1723 [2024-11-08 18:33:45,683 INFO L226 Difference]: Without dead ends: 1108 [2024-11-08 18:33:45,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:33:45,685 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 791 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:45,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 525 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:33:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-08 18:33:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1038. [2024-11-08 18:33:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 964 states have (on average 1.4097510373443984) internal successors, (1359), 967 states have internal predecessors, (1359), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 18:33:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1491 transitions. [2024-11-08 18:33:45,800 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1491 transitions. Word has length 140 [2024-11-08 18:33:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:45,801 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1491 transitions. [2024-11-08 18:33:45,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:33:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1491 transitions. [2024-11-08 18:33:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 18:33:45,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:45,803 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:33:45,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2019815448, now seen corresponding path program 1 times [2024-11-08 18:33:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33375898] [2024-11-08 18:33:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:33:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:33:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 18:33:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33375898] [2024-11-08 18:33:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33375898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:33:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350632565] [2024-11-08 18:33:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:47,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:33:47,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:33:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:47,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-08 18:33:47,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:47,579 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 53 treesize of output 52 [2024-11-08 18:33:47,844 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 104 treesize of output 76 [2024-11-08 18:33:48,300 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-08 18:33:48,916 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-08 18:33:49,397 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-08 18:33:49,848 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-08 18:33:50,276 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-08 18:33:50,700 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-08 18:33:51,038 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-08 18:33:51,363 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-08 18:33:51,696 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-08 18:33:52,169 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-08 18:33:52,289 INFO L349 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2024-11-08 18:33:52,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 64 [2024-11-08 18:33:52,459 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-08 18:33:52,859 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 0 case distinctions, treesize of input 72 treesize of output 48 [2024-11-08 18:33:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 152 proven. 93 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 18:33:52,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:34:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350632565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:34:14,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:34:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 27 [2024-11-08 18:34:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127431064] [2024-11-08 18:34:14,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:34:14,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 18:34:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:34:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 18:34:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=979, Unknown=5, NotChecked=0, Total=1122 [2024-11-08 18:34:14,500 INFO L87 Difference]: Start difference. First operand 1038 states and 1491 transitions. Second operand has 27 states, 25 states have (on average 5.44) internal successors, (136), 27 states have internal predecessors, (136), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-08 18:34:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:21,844 INFO L93 Difference]: Finished difference Result 2220 states and 3153 transitions. [2024-11-08 18:34:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 18:34:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.44) internal successors, (136), 27 states have internal predecessors, (136), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) Word has length 142 [2024-11-08 18:34:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:21,849 INFO L225 Difference]: With dead ends: 2220 [2024-11-08 18:34:21,849 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 18:34:21,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=1104, Invalid=5863, Unknown=5, NotChecked=0, Total=6972 [2024-11-08 18:34:21,854 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1254 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:34:21,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2730 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 18:34:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 18:34:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 959. [2024-11-08 18:34:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 905 states have (on average 1.4011049723756905) internal successors, (1268), 908 states have internal predecessors, (1268), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 18:34:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1356 transitions. [2024-11-08 18:34:21,964 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1356 transitions. Word has length 142 [2024-11-08 18:34:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1356 transitions. [2024-11-08 18:34:21,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.44) internal successors, (136), 27 states have internal predecessors, (136), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-08 18:34:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1356 transitions. [2024-11-08 18:34:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 18:34:21,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:21,967 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:21,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:34:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:34:22,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -886784899, now seen corresponding path program 1 times [2024-11-08 18:34:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:34:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165823630] [2024-11-08 18:34:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:34:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:34:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:34:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:34:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:34:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:34:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:34:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:34:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:34:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:34:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:34:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:34:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:34:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:34:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:34:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:34:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:34:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:34:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:34:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165823630] [2024-11-08 18:34:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165823630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:34:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:34:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:34:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917189952] [2024-11-08 18:34:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:34:24,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:34:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:34:24,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:34:24,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:34:24,316 INFO L87 Difference]: Start difference. First operand 959 states and 1356 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:25,676 INFO L93 Difference]: Finished difference Result 1806 states and 2549 transitions. [2024-11-08 18:34:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:34:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-11-08 18:34:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:25,683 INFO L225 Difference]: With dead ends: 1806 [2024-11-08 18:34:25,683 INFO L226 Difference]: Without dead ends: 1213 [2024-11-08 18:34:25,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:34:25,685 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 360 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:34:25,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1047 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:34:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-08 18:34:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1022. [2024-11-08 18:34:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 971 states have (on average 1.407826982492276) internal successors, (1367), 973 states have internal predecessors, (1367), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:34:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1451 transitions. [2024-11-08 18:34:25,804 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1451 transitions. Word has length 142 [2024-11-08 18:34:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:25,804 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1451 transitions. [2024-11-08 18:34:25,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1451 transitions. [2024-11-08 18:34:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 18:34:25,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:25,805 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:34:25,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:25,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1356457822, now seen corresponding path program 1 times [2024-11-08 18:34:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:34:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883887395] [2024-11-08 18:34:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:34:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:34:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:34:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:34:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:34:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:34:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:34:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:34:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:34:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:34:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:34:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:34:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:34:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:34:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:34:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 18:34:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:34:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:34:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:34:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883887395] [2024-11-08 18:34:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883887395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:34:27,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:34:27,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:34:27,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727503530] [2024-11-08 18:34:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:34:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:34:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:34:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:34:27,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:34:27,269 INFO L87 Difference]: Start difference. First operand 1022 states and 1451 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:27,964 INFO L93 Difference]: Finished difference Result 2090 states and 2970 transitions. [2024-11-08 18:34:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:34:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-08 18:34:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:27,969 INFO L225 Difference]: With dead ends: 2090 [2024-11-08 18:34:27,970 INFO L226 Difference]: Without dead ends: 1071 [2024-11-08 18:34:27,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:34:27,972 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 433 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:34:27,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 534 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:34:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-08 18:34:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1015. [2024-11-08 18:34:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 964 states have (on average 1.404564315352697) internal successors, (1354), 966 states have internal predecessors, (1354), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:34:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1438 transitions. [2024-11-08 18:34:28,126 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1438 transitions. Word has length 143 [2024-11-08 18:34:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:28,127 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1438 transitions. [2024-11-08 18:34:28,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1438 transitions. [2024-11-08 18:34:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 18:34:28,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:28,129 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:34:28,129 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:28,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2103856120, now seen corresponding path program 1 times [2024-11-08 18:34:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:34:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045733144] [2024-11-08 18:34:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:34:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:34:28,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:34:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:34:28,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:34:28,412 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:34:28,413 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:34:28,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:34:28,419 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:34:28,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:34:28,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:34:28 BoogieIcfgContainer [2024-11-08 18:34:28,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:34:28,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:34:28,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:34:28,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:34:28,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:33:01" (3/4) ... [2024-11-08 18:34:28,621 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:34:28,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:34:28,624 INFO L158 Benchmark]: Toolchain (without parser) took 88568.27ms. Allocated memory was 161.5MB in the beginning and 950.0MB in the end (delta: 788.5MB). Free memory was 128.0MB in the beginning and 779.1MB in the end (delta: -651.1MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,624 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory was 82.3MB in the beginning and 82.3MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:34:28,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.22ms. Allocated memory is still 161.5MB. Free memory was 128.0MB in the beginning and 109.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.38ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,628 INFO L158 Benchmark]: Boogie Preprocessor took 100.74ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 102.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,628 INFO L158 Benchmark]: RCFGBuilder took 1087.22ms. Allocated memory is still 161.5MB. Free memory was 101.5MB in the beginning and 58.1MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,628 INFO L158 Benchmark]: TraceAbstraction took 86769.10ms. Allocated memory was 161.5MB in the beginning and 950.0MB in the end (delta: 788.5MB). Free memory was 57.4MB in the beginning and 779.1MB in the end (delta: -721.6MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-08 18:34:28,628 INFO L158 Benchmark]: Witness Printer took 6.36ms. Allocated memory is still 950.0MB. Free memory is still 779.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:34:28,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory was 82.3MB in the beginning and 82.3MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.22ms. Allocated memory is still 161.5MB. Free memory was 128.0MB in the beginning and 109.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.38ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.74ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 102.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1087.22ms. Allocated memory is still 161.5MB. Free memory was 101.5MB in the beginning and 58.1MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 86769.10ms. Allocated memory was 161.5MB in the beginning and 950.0MB in the end (delta: 788.5MB). Free memory was 57.4MB in the beginning and 779.1MB in the end (delta: -721.6MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * Witness Printer took 6.36ms. Allocated memory is still 950.0MB. Free memory is still 779.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someUnaryDOUBLEoperation at line 51. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] signed long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L69] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_11 [L128] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L110] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L115] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L118] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L139] RET updateVariables() [L140] CALL step() [L73] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L74] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_7_Pointer)); [L80] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L80] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_10_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=1073741822] [L81] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_2) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L88] COND FALSE !(! (*(WrapperStruct00_var_1_11_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L91] (*(WrapperStruct00_var_1_6_Pointer)) = (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L93] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L131] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) [L131] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) [L131] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131-L132] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.4s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6999 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6997 mSDsluCounter, 21115 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16491 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8943 IncrementalHoareTripleChecker+Invalid, 9401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 4624 mSDtfsCounter, 8943 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1355 GetRequests, 1093 SyntacticMatches, 8 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=18, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1547 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 59.5s InterpolantComputationTime, 3316 NumberOfCodeBlocks, 3316 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3150 ConstructedInterpolants, 0 QuantifiedInterpolants, 36188 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 10875/11040 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-08 18:34:28,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX --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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:34:31,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:34:31,190 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:34:31,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:34:31,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:34:31,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:34:31,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:34:31,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:34:31,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:34:31,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:34:31,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:34:31,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:34:31,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:34:31,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:34:31,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:34:31,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:34:31,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:34:31,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:34:31,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:34:31,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:34:31,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:34:31,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:34:31,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:34:31,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:34:31,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:34:31,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:34:31,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:34:31,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:34:31,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:34:31,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:34:31,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:34:31,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:34:31,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:34:31,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:34:31,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:34:31,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:34:31,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:34:31,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:34:31,268 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:34:31,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:34:31,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:34:31,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:34:31,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:34:31,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:34:31,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2024-11-08 18:34:31,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:34:31,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:34:31,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:34:31,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:34:31,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:34:31,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i Unable to find full path for "g++" [2024-11-08 18:34:33,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:34:34,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:34:34,232 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-08 18:34:34,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/08b88feab/48570b6ace0045e8aa8add55ad51eabd/FLAG80c28bb2f [2024-11-08 18:34:34,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/data/08b88feab/48570b6ace0045e8aa8add55ad51eabd [2024-11-08 18:34:34,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:34:34,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:34:34,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:34:34,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:34:34,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:34:34,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:34:34" (1/1) ... [2024-11-08 18:34:34,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c95702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:34, skipping insertion in model container [2024-11-08 18:34:34,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:34:34" (1/1) ... [2024-11-08 18:34:34,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:34:34,792 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_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-08 18:34:34,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:34:35,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:34:35,027 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_47fd0846-d8fb-4f65-a4f7-438ee7821967/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-08 18:34:35,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:34:35,128 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:34:35,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35 WrapperNode [2024-11-08 18:34:35,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:34:35,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:34:35,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:34:35,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:34:35,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,227 INFO L138 Inliner]: procedures = 34, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 635 [2024-11-08 18:34:35,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:34:35,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:34:35,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:34:35,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:34:35,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,322 INFO L175 MemorySlicer]: Split 152 memory accesses to 2 slices as follows [2, 150]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-08 18:34:35,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:34:35,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:34:35,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:34:35,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:34:35,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (1/1) ... [2024-11-08 18:34:35,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:34:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:34:35,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:34:35,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:34:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:34:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 18:34:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 18:34:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 18:34:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 18:34:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 18:34:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 18:34:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:34:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:34:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:34:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:34:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:34:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:34:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 18:34:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 18:34:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 18:34:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 18:34:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:34:35,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:34:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:34:35,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:34:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 18:34:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 18:34:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:34:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:34:35,746 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:34:35,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:34:38,998 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2024-11-08 18:34:38,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:34:39,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:34:39,026 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:34:39,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:34:39 BoogieIcfgContainer [2024-11-08 18:34:39,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:34:39,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:34:39,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:34:39,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:34:39,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:34:34" (1/3) ... [2024-11-08 18:34:39,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4cc8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:34:39, skipping insertion in model container [2024-11-08 18:34:39,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:34:35" (2/3) ... [2024-11-08 18:34:39,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4cc8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:34:39, skipping insertion in model container [2024-11-08 18:34:39,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:34:39" (3/3) ... [2024-11-08 18:34:39,038 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-08 18:34:39,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:34:39,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:34:39,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:34:39,146 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;@6e61c48e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:34:39,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:34:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:34:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:34:39,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:39,184 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:39,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1526752987, now seen corresponding path program 1 times [2024-11-08 18:34:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:34:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850842483] [2024-11-08 18:34:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:39,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:34:39,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:34:39,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:39,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:39,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:34:39,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-08 18:34:39,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:34:39,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:34:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850842483] [2024-11-08 18:34:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850842483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:34:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:34:39,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:34:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666839849] [2024-11-08 18:34:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:34:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:34:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:34:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:34:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:34:39,856 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:39,915 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-08 18:34:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:34:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-08 18:34:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:39,930 INFO L225 Difference]: With dead ends: 291 [2024-11-08 18:34:39,931 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 18:34:39,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-08 18:34:39,943 INFO L432 NwaCegarLoop]: 215 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, 215 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-08 18:34:39,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:34:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 18:34:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-08 18:34:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:34:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-08 18:34:40,003 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-08 18:34:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:40,004 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-08 18:34:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:34:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-08 18:34:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:34:40,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:40,011 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:40,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:40,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:40,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash -198408637, now seen corresponding path program 1 times [2024-11-08 18:34:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:34:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106989521] [2024-11-08 18:34:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:40,216 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-08 18:34:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:34:40,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:40,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:40,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:34:40,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:34:40,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:34:40,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:34:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106989521] [2024-11-08 18:34:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106989521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:34:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:34:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:34:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451630466] [2024-11-08 18:34:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:34:40,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:34:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:34:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:34:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:34:40,790 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:34:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:40,875 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-08 18:34:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:34:40,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 18:34:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:40,881 INFO L225 Difference]: With dead ends: 289 [2024-11-08 18:34:40,883 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 18:34:40,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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-08 18:34:40,885 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-08 18:34:40,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:34:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 18:34:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-08 18:34:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:34:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-08 18:34:40,913 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-08 18:34:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:40,915 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-08 18:34:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:34:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-08 18:34:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 18:34:40,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:40,921 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:40,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1064238987, now seen corresponding path program 1 times [2024-11-08 18:34:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:34:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828042661] [2024-11-08 18:34:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:41,124 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-08 18:34:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:34:41,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:41,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:34:41,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:34:41,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:34:41,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:34:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828042661] [2024-11-08 18:34:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828042661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:34:41,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:34:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:34:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019836406] [2024-11-08 18:34:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:34:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:34:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:34:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:34:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:34:41,592 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:34:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:34:41,639 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2024-11-08 18:34:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:34:41,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-08 18:34:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:34:41,642 INFO L225 Difference]: With dead ends: 368 [2024-11-08 18:34:41,642 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 18:34:41,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-08 18:34:41,644 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:34:41,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:34:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 18:34:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2024-11-08 18:34:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:34:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2024-11-08 18:34:41,657 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 135 [2024-11-08 18:34:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:34:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2024-11-08 18:34:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:34:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2024-11-08 18:34:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 18:34:41,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:34:41,660 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:34:41,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:34:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:34:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2052846782, now seen corresponding path program 1 times [2024-11-08 18:34:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:34:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294579388] [2024-11-08 18:34:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:41,867 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-08 18:34:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:34:41,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:41,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/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-08 18:34:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:42,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-08 18:34:42,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:44,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 18:34:46,148 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 14 [2024-11-08 18:34:48,321 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 44 treesize of output 27 [2024-11-08 18:34:49,285 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 44 treesize of output 27 [2024-11-08 18:34:50,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2024-11-08 18:34:54,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 38 [2024-11-08 18:34:55,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2024-11-08 18:35:04,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 76 [2024-11-08 18:35:17,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 89 [2024-11-08 18:35:17,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 100 [2024-11-08 18:35:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 280 proven. 144 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 18:35:22,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:35:38,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:35:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294579388] [2024-11-08 18:35:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294579388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:35:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329888290] [2024-11-08 18:35:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:35:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:38,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:35:38,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47fd0846-d8fb-4f65-a4f7-438ee7821967/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:35:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:38,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 18:35:38,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:35:38,650 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 110 treesize of output 109 [2024-11-08 18:35:41,606 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 154 treesize of output 139 [2024-11-08 18:35:45,315 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 154 treesize of output 141 [2024-11-08 18:35:49,075 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 159 treesize of output 144 [2024-11-08 18:35:54,673 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 165 treesize of output 148 [2024-11-08 18:36:00,378 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 171 treesize of output 152 [2024-11-08 18:36:09,056 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 177 treesize of output 156 [2024-11-08 18:36:25,585 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 178 treesize of output 157 [2024-11-08 18:36:53,007 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 173 treesize of output 154 [2024-11-08 18:37:26,135 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 178 treesize of output 161 [2024-11-08 18:38:09,745 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 188 treesize of output 167 [2024-11-08 18:38:47,881 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 176 treesize of output 152 [2024-11-08 18:38:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 380 refuted. 24 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 18:38:48,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:38:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329888290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:38:50,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:38:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 39 [2024-11-08 18:38:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675261005] [2024-11-08 18:38:50,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:38:50,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 18:38:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:38:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 18:38:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2038, Unknown=40, NotChecked=0, Total=2352 [2024-11-08 18:38:50,356 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 40 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 18 states have call successors, (32), 17 states have call predecessors, (32), 18 states have return successors, (32), 17 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-08 18:38:52,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:38:55,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:38:56,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:38:57,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:01,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:04,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:27,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:32,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:39:55,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:40:18,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:40:45,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:40:49,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:40:54,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:40:58,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:41:02,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:41:03,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:41:48,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:42:32,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:43:34,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:43:38,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:43:42,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:43:47,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:44:52,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:44:57,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:45:01,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:45:05,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:45:54,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:45:58,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:02,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:06,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:44,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:48,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:52,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:46:56,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:47:28,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]