./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:52:18,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:52:18,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:52:18,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:52:18,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:52:18,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:52:18,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:52:18,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:52:18,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:52:18,194 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:52:18,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:52:18,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:52:18,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:52:18,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:52:18,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:52:18,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:52:18,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:52:18,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:52:18,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:52:18,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:52:18,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:52:18,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:52:18,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:52:18,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:52:18,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:52:18,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:52:18,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:52:18,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:52:18,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:52:18,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:52:18,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:52:18,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:52:18,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:18,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:52:18,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:52:18,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:52:18,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:52:18,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:52:18,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:52:18,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:52:18,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:52:18,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:52:18,218 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 -> ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 [2024-11-08 16:52:18,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:52:18,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:52:18,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:52:18,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:52:18,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:52:18,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i Unable to find full path for "g++" [2024-11-08 16:52:21,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:52:21,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:52:21,514 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-08 16:52:21,526 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/ae6300203/360cf5e817ea45159eb63d0b2cad7275/FLAG0852ad321 [2024-11-08 16:52:21,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/ae6300203/360cf5e817ea45159eb63d0b2cad7275 [2024-11-08 16:52:21,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:52:21,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:52:21,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:21,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:52:21,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:52:21,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:21" (1/1) ... [2024-11-08 16:52:21,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14521968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:21, skipping insertion in model container [2024-11-08 16:52:21,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:21" (1/1) ... [2024-11-08 16:52:21,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:52:21,865 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-08 16:52:21,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:21,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:52:21,978 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-08 16:52:22,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:22,095 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:52:22,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22 WrapperNode [2024-11-08 16:52:22,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:22,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:22,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:52:22,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:52:22,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,195 INFO L138 Inliner]: procedures = 30, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-08 16:52:22,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:22,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:52:22,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:52:22,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:52:22,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,242 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:52:22,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:52:22,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:52:22,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:52:22,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:52:22,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (1/1) ... [2024-11-08 16:52:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:22,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:52:22,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:52:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:52:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:52:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:52:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:52:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:52:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:52:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:52:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:52:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:52:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:52:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:52:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:52:22,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:52:22,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:52:23,519 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 16:52:23,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:52:23,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:52:23,548 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:52:23,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:23 BoogieIcfgContainer [2024-11-08 16:52:23,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:52:23,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:52:23,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:52:23,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:52:23,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:52:21" (1/3) ... [2024-11-08 16:52:23,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767f8d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:23, skipping insertion in model container [2024-11-08 16:52:23,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:22" (2/3) ... [2024-11-08 16:52:23,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767f8d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:23, skipping insertion in model container [2024-11-08 16:52:23,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:23" (3/3) ... [2024-11-08 16:52:23,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-08 16:52:23,610 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:52:23,611 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:52:23,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:52:23,708 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;@6b473584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:52:23,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:52:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:52:23,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:23,743 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:23,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:23,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 804965722, now seen corresponding path program 1 times [2024-11-08 16:52:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17400475] [2024-11-08 16:52:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:52:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:52:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:52:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:52:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:52:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:52:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:52:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:52:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:52:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:52:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:52:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:52:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:52:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:52:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:52:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17400475] [2024-11-08 16:52:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17400475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:24,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:52:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348636081] [2024-11-08 16:52:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:52:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:52:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:52:24,573 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:24,639 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 16:52:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:52:24,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 16:52:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:24,657 INFO L225 Difference]: With dead ends: 181 [2024-11-08 16:52:24,657 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 16:52:24,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 16:52:24,673 INFO L432 NwaCegarLoop]: 132 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, 132 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 16:52:24,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 16:52:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 16:52:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 16:52:24,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 16:52:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:24,754 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 16:52:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 16:52:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:52:24,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:24,759 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:24,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:52:24,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1705454400, now seen corresponding path program 1 times [2024-11-08 16:52:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473013574] [2024-11-08 16:52:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:52:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:52:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:52:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:52:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:52:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:52:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:52:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:52:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:52:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:52:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:52:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:52:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:52:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:52:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:52:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473013574] [2024-11-08 16:52:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473013574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:25,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:52:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612661994] [2024-11-08 16:52:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:25,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:52:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:52:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:52:25,544 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:25,620 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 16:52:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:52:25,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 16:52:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:25,623 INFO L225 Difference]: With dead ends: 179 [2024-11-08 16:52:25,624 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:52:25,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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 16:52:25,627 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 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 16:52:25,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:52:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:52:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 16:52:25,643 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 16:52:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:25,645 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 16:52:25,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 16:52:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:25,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:25,649 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:52:25,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -352906405, now seen corresponding path program 1 times [2024-11-08 16:52:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955864564] [2024-11-08 16:52:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:52:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589237462] [2024-11-08 16:52:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:26,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:26,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:26,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:26,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:52:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:27,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 16:52:27,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:30,169 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 16:52:30,945 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 16:52:31,687 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 16:52:32,393 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 16:52:33,066 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 16:52:33,549 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 16:52:34,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:52:34,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:52:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:52:34,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:52:34,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:52:34,091 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:52:34,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-08 16:52:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:52:34,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:35,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_306))) (< (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) 1))) (not (= v_ArrVal_306 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_306 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))))) is different from false [2024-11-08 16:52:39,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_304 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_304)))) (or (< (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296)) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_306))) (< (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) 1))) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_306 c_~WrapperStruct00_var_1_11_Pointer~0.offset)) v_ArrVal_306))))) is different from false [2024-11-08 16:52:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955864564] [2024-11-08 16:52:41,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:52:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589237462] [2024-11-08 16:52:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589237462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:41,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:52:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-08 16:52:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116693809] [2024-11-08 16:52:41,612 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:41,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:52:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:52:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=353, Unknown=2, NotChecked=78, Total=506 [2024-11-08 16:52:41,616 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:51,434 INFO L93 Difference]: Finished difference Result 224 states and 327 transitions. [2024-11-08 16:52:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:52:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-11-08 16:52:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:51,438 INFO L225 Difference]: With dead ends: 224 [2024-11-08 16:52:51,438 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:52:51,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=166, Invalid=596, Unknown=2, NotChecked=106, Total=870 [2024-11-08 16:52:51,441 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 500 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 7 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:51,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 259 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 652 Invalid, 25 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 16:52:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:52:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2024-11-08 16:52:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-08 16:52:51,463 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 121 [2024-11-08 16:52:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-08 16:52:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-08 16:52:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:51,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:51,468 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:51,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:51,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:51,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash -939712419, now seen corresponding path program 1 times [2024-11-08 16:52:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727747982] [2024-11-08 16:52:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:52:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:52:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:52:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:52:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:52:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:52:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:52:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:52:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:52:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:52:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:52:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:52:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:52:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:52:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:52:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727747982] [2024-11-08 16:52:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727747982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:52:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292336741] [2024-11-08 16:52:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:53,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:52:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:52:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:52:53,130 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:53,878 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2024-11-08 16:52:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:52:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:53,880 INFO L225 Difference]: With dead ends: 229 [2024-11-08 16:52:53,881 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:52:53,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:52:53,882 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 162 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:53,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 327 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:52:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:52:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2024-11-08 16:52:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2024-11-08 16:52:53,902 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 121 [2024-11-08 16:52:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2024-11-08 16:52:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2024-11-08 16:52:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:53,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:53,905 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:53,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:52:53,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:53,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2041850147, now seen corresponding path program 1 times [2024-11-08 16:52:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065293459] [2024-11-08 16:52:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:52:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:52:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:52:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:52:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:52:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:52:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:52:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:52:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:52:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:52:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:52:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:52:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:52:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:52:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:52:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065293459] [2024-11-08 16:52:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065293459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:55,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:52:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847004230] [2024-11-08 16:52:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:55,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:52:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:52:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:52:55,129 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:56,193 INFO L93 Difference]: Finished difference Result 241 states and 351 transitions. [2024-11-08 16:52:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:52:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:56,197 INFO L225 Difference]: With dead ends: 241 [2024-11-08 16:52:56,197 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 16:52:56,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:52:56,199 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:56,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 337 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:52:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 16:52:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2024-11-08 16:52:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-08 16:52:56,222 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 121 [2024-11-08 16:52:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:56,223 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-08 16:52:56,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-08 16:52:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:56,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:56,227 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:52:56,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1666311135, now seen corresponding path program 1 times [2024-11-08 16:52:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522658939] [2024-11-08 16:52:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:52:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038943167] [2024-11-08 16:52:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:56,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:56,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:56,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:56,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:52:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:57,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 16:52:57,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:02,024 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 16:53:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:53:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:53:02,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:53:02,481 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 16:53:02,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2024-11-08 16:53:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:04,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522658939] [2024-11-08 16:53:04,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:53:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038943167] [2024-11-08 16:53:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038943167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:04,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:53:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132594061] [2024-11-08 16:53:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:04,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:53:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:53:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:53:04,472 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:11,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:20,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:21,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:24,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:25,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:29,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:34,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:36,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-08 16:53:40,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-08 16:53:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:41,992 INFO L93 Difference]: Finished difference Result 242 states and 351 transitions. [2024-11-08 16:53:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:53:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:53:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:41,996 INFO L225 Difference]: With dead ends: 242 [2024-11-08 16:53:41,996 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 16:53:41,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:53:41,998 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:41,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 413 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 41 Unknown, 0 Unchecked, 34.7s Time] [2024-11-08 16:53:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 16:53:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2024-11-08 16:53:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:53:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-08 16:53:42,025 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 121 [2024-11-08 16:53:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:42,025 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-08 16:53:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-08 16:53:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:53:42,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:42,028 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:53:42,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:42,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 16:53:42,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -256065948, now seen corresponding path program 1 times [2024-11-08 16:53:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:42,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939119884] [2024-11-08 16:53:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:53:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:53:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:53:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:53:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:53:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:53:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:53:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:53:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:53:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:53:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:53:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:53:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:53:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:53:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:53:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939119884] [2024-11-08 16:53:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939119884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:53:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370005496] [2024-11-08 16:53:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:53:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:53:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:53:43,334 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:43,992 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2024-11-08 16:53:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:53:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:43,995 INFO L225 Difference]: With dead ends: 276 [2024-11-08 16:53:43,995 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 16:53:43,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:53:43,997 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 254 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:44,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 378 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:53:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 16:53:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2024-11-08 16:53:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.4198473282442747) internal successors, (186), 131 states have internal predecessors, (186), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:53:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2024-11-08 16:53:44,066 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 122 [2024-11-08 16:53:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:44,067 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2024-11-08 16:53:44,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2024-11-08 16:53:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:53:44,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:44,073 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:53:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:53:44,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 146755363, now seen corresponding path program 1 times [2024-11-08 16:53:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406005614] [2024-11-08 16:53:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:53:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:53:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:53:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:53:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:53:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:53:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:53:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:53:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:53:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:53:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:53:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:53:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:53:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:53:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:53:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406005614] [2024-11-08 16:53:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406005614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:45,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:53:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006185497] [2024-11-08 16:53:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:45,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:53:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:53:45,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:45,467 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:53:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:46,528 INFO L93 Difference]: Finished difference Result 327 states and 475 transitions. [2024-11-08 16:53:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:53:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-11-08 16:53:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:46,531 INFO L225 Difference]: With dead ends: 327 [2024-11-08 16:53:46,531 INFO L226 Difference]: Without dead ends: 182 [2024-11-08 16:53:46,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:53:46,533 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 145 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:46,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 457 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:53:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-08 16:53:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2024-11-08 16:53:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 127 states have internal predecessors, (180), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:53:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-08 16:53:46,564 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 122 [2024-11-08 16:53:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:46,565 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-08 16:53:46,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:53:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-08 16:53:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:53:46,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:46,567 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:53:46,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:53:46,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:46,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1081745420, now seen corresponding path program 1 times [2024-11-08 16:53:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758564216] [2024-11-08 16:53:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:53:46,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384502778] [2024-11-08 16:53:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:46,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:53:46,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:53:46,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:53:46,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:53:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:53:50,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:53:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:53:52,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:53:52,062 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:53:52,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:53:52,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:53:52,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 16:53:52,274 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:52,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:53:52,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:53:52 BoogieIcfgContainer [2024-11-08 16:53:52,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:53:52,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:53:52,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:53:52,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:53:52,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:23" (3/4) ... [2024-11-08 16:53:52,506 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:53:52,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:53:52,509 INFO L158 Benchmark]: Toolchain (without parser) took 90956.33ms. Allocated memory was 142.6MB in the beginning and 287.3MB in the end (delta: 144.7MB). Free memory was 102.6MB in the beginning and 128.5MB in the end (delta: -25.9MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,509 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:53:52,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.74ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 85.3MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.70ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,510 INFO L158 Benchmark]: Boogie Preprocessor took 81.60ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,511 INFO L158 Benchmark]: RCFGBuilder took 1265.86ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 107.9MB in the end (delta: -28.9MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,511 INFO L158 Benchmark]: TraceAbstraction took 88924.43ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 166.9MB in the beginning and 128.5MB in the end (delta: 38.4MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2024-11-08 16:53:52,512 INFO L158 Benchmark]: Witness Printer took 7.05ms. Allocated memory is still 287.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:53:52,517 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.35ms. Allocated memory is still 142.6MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.74ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 85.3MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.70ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.60ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1265.86ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 107.9MB in the end (delta: -28.9MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 88924.43ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 166.9MB in the beginning and 128.5MB in the end (delta: 38.4MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. * Witness Printer took 7.05ms. Allocated memory is still 287.3MB. Free memory is still 128.5MB. 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 129. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L49] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L51] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L52] unsigned long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L53] unsigned long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] signed char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L109] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L111] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L112] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L120] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L123] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L124] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L63] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L63] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L63] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))))) [L64] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L64] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L76] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_5_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=2] [L77] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=2] [L77] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))); [L78] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_0=-(((__int128) 0 << 64) | 18446743897615892558U), stepLocal_1=2] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_5_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L85] unsigned char stepLocal_3 = (*(WrapperStruct00_var_1_9_Pointer)); [L86] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=2, stepLocal_2=-109, stepLocal_3=256] [L87] COND FALSE !((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && stepLocal_3) [L98] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L98] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4))))) [L129] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer)) [L129] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129-L130] return (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.6s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 51.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 mSolverCounterUnknown, 1360 SdHoareTripleChecker+Valid, 43.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1360 mSDsluCounter, 2682 SdHoareTripleChecker+Invalid, 42.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3055 IncrementalHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 848 mSDtfsCounter, 3055 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 185 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 958 ConstructedInterpolants, 6 QuantifiedInterpolants, 13433 SizeOfPredicates, 21 NumberOfNonLiveVariables, 978 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 3304/3360 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 16:53:52,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:53:55,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:53:55,859 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:53:55,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:53:55,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:53:55,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:53:55,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:53:55,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:53:55,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:53:55,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:53:55,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:53:55,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:53:55,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:53:55,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:53:55,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:53:55,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:53:55,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:53:55,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:53:55,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:53:55,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:53:55,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:53:55,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:53:55,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:53:55,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:53:55,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:53:55,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:53:55,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:53:55,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:53:55,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:53:55,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:53:55,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:53:55,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:53:55,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:53:55,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:53:55,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:53:55,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:53:55,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:53:55,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:53:55,923 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:53:55,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:53:55,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:53:55,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:53:55,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:53:55,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:53:55,926 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 -> ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 [2024-11-08 16:53:56,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:53:56,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:53:56,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:53:56,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:53:56,517 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:53:56,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i Unable to find full path for "g++" [2024-11-08 16:53:59,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:53:59,642 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:53:59,642 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-08 16:53:59,654 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/ec56a1209/85cb7d4d1b5442c2890d25d8e4bc1dbf/FLAGa4d9b1db8 [2024-11-08 16:53:59,670 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/data/ec56a1209/85cb7d4d1b5442c2890d25d8e4bc1dbf [2024-11-08 16:53:59,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:53:59,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:53:59,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:53:59,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:53:59,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:53:59,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:53:59" (1/1) ... [2024-11-08 16:53:59,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef05339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:59, skipping insertion in model container [2024-11-08 16:53:59,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:53:59" (1/1) ... [2024-11-08 16:53:59,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:54:00,042 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-08 16:54:00,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:54:00,194 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:54:00,211 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_c23b1ba7-acf2-46d6-8438-145a772c91f6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-08 16:54:00,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:54:00,364 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:54:00,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00 WrapperNode [2024-11-08 16:54:00,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:54:00,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:54:00,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:54:00,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:54:00,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,456 INFO L138 Inliner]: procedures = 37, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-11-08 16:54:00,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:54:00,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:54:00,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:54:00,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:54:00,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,519 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2024-11-08 16:54:00,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:54:00,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:54:00,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:54:00,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:54:00,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (1/1) ... [2024-11-08 16:54:00,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:54:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:54:00,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:54:00,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:54:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:54:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:54:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:54:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:54:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:54:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:54:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:54:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:54:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:54:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:54:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:54:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:54:00,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:54:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:54:00,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:54:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:54:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:54:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:54:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:54:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:54:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:54:00,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:54:00,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:54:02,043 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 16:54:02,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:54:02,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:54:02,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:54:02,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:54:02 BoogieIcfgContainer [2024-11-08 16:54:02,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:54:02,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:54:02,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:54:02,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:54:02,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:53:59" (1/3) ... [2024-11-08 16:54:02,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed76f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:54:02, skipping insertion in model container [2024-11-08 16:54:02,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:54:00" (2/3) ... [2024-11-08 16:54:02,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed76f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:54:02, skipping insertion in model container [2024-11-08 16:54:02,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:54:02" (3/3) ... [2024-11-08 16:54:02,087 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-08 16:54:02,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:54:02,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:54:02,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:54:02,255 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;@25949cec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:54:02,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:54:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:54:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:54:02,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:54:02,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:54:02,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:54:02,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1301228568, now seen corresponding path program 1 times [2024-11-08 16:54:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:54:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327028877] [2024-11-08 16:54:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:02,304 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 16:54:02,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:54:02,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:02,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:02,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:54:02,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:54:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-08 16:54:02,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:54:02,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:54:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327028877] [2024-11-08 16:54:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327028877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:54:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453958295] [2024-11-08 16:54:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:54:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:54:02,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:54:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:54:02,954 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:54:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:54:03,009 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 16:54:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:54:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 16:54:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:54:03,027 INFO L225 Difference]: With dead ends: 181 [2024-11-08 16:54:03,027 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 16:54:03,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 16:54:03,041 INFO L432 NwaCegarLoop]: 132 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, 132 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 16:54:03,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:54:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 16:54:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 16:54:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:54:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 16:54:03,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 16:54:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:54:03,112 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 16:54:03,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:54:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 16:54:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:54:03,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:54:03,118 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:54:03,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:54:03,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:03,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:54:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2093250050, now seen corresponding path program 1 times [2024-11-08 16:54:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:54:03,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098168336] [2024-11-08 16:54:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:03,322 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 16:54:03,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:54:03,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:03,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:03,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:54:03,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:54:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:54:03,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:54:03,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:54:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098168336] [2024-11-08 16:54:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098168336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:03,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:54:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358656724] [2024-11-08 16:54:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:03,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:54:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:54:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:54:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:54:03,946 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:54:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:54:04,062 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 16:54:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:54:04,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 16:54:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:54:04,066 INFO L225 Difference]: With dead ends: 179 [2024-11-08 16:54:04,066 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:54:04,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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 16:54:04,069 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:54:04,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:54:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:54:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:54:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:54:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 16:54:04,090 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 16:54:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:54:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 16:54:04,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:54:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 16:54:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:54:04,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:54:04,103 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:54:04,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:04,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:54:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -185680999, now seen corresponding path program 1 times [2024-11-08 16:54:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:54:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884083139] [2024-11-08 16:54:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:04,306 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 16:54:04,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:54:04,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:04,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:54:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:04,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:54:04,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:54:11,682 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 38 treesize of output 36 [2024-11-08 16:54:17,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:54:17,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 16:54:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:54:17,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:54:17,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:54:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884083139] [2024-11-08 16:54:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884083139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:17,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:54:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476717939] [2024-11-08 16:54:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:54:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:54:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:54:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2024-11-08 16:54:17,666 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:54:28,526 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 16:54:32,800 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 16:54:36,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:54:41,727 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 16:54:46,354 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 16:54:50,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:54:54,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:03,525 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 48 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:55:07,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:55:12,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:16,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:55:20,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:29,740 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 52 DAG size of output: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:55:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:55:32,804 INFO L93 Difference]: Finished difference Result 224 states and 327 transitions. [2024-11-08 16:55:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:55:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:55:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:55:32,814 INFO L225 Difference]: With dead ends: 224 [2024-11-08 16:55:32,814 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:55:32,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2024-11-08 16:55:32,824 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 180 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:55:32,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 407 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 793 Invalid, 11 Unknown, 0 Unchecked, 56.8s Time] [2024-11-08 16:55:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:55:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2024-11-08 16:55:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:55:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-11-08 16:55:32,876 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 121 [2024-11-08 16:55:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:55:32,877 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-11-08 16:55:32,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:55:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-08 16:55:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:55:32,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:55:32,884 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:55:32,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:55:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:55:33,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:55:33,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:55:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash -772487013, now seen corresponding path program 1 times [2024-11-08 16:55:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:55:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200238971] [2024-11-08 16:55:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:55:33,087 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 16:55:33,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:55:33,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:55:33,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:55:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:55:33,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:55:33,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:55:36,414 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 28 treesize of output 34 [2024-11-08 16:55:40,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:55:40,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 18 [2024-11-08 16:55:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:55:40,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:55:40,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:55:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200238971] [2024-11-08 16:55:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200238971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:55:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:55:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:55:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559200260] [2024-11-08 16:55:40,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:55:40,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:55:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:55:40,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:55:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2024-11-08 16:55:40,550 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:55:45,595 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 16:55:49,670 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 16:55:53,753 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 16:55:57,764 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 16:56:03,030 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 16:56:07,114 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 16:56:11,244 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 16:56:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:56:12,358 INFO L93 Difference]: Finished difference Result 235 states and 342 transitions. [2024-11-08 16:56:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:56:12,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:56:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:56:12,363 INFO L225 Difference]: With dead ends: 235 [2024-11-08 16:56:12,364 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 16:56:12,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2024-11-08 16:56:12,366 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 170 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:56:12,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 324 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 31.6s Time] [2024-11-08 16:56:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 16:56:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2024-11-08 16:56:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:56:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-08 16:56:12,390 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 121 [2024-11-08 16:56:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:56:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-08 16:56:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:56:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-08 16:56:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:56:12,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:56:12,395 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:12,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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)] Ended with exit code 0 [2024-11-08 16:56:12,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:56:12,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:56:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:56:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1874624741, now seen corresponding path program 1 times [2024-11-08 16:56:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:56:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712599668] [2024-11-08 16:56:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:56:12,599 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 16:56:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:56:12,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:56:12,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (6)] Waiting until timeout for monitored process [2024-11-08 16:56:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:56:13,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:56:13,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:56:16,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-08 16:56:20,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:20,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 15 [2024-11-08 16:56:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:56:20,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:56:20,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:56:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712599668] [2024-11-08 16:56:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712599668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:56:20,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:56:20,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:56:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208244496] [2024-11-08 16:56:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:56:20,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:56:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:56:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:56:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2024-11-08 16:56:20,611 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:56:25,686 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 16:56:29,798 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 16:56:33,852 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 16:56:37,861 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 16:56:42,168 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 16:56:46,356 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 16:56:50,511 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 16:56:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:56:51,509 INFO L93 Difference]: Finished difference Result 245 states and 355 transitions. [2024-11-08 16:56:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:56:51,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:56:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:56:51,513 INFO L225 Difference]: With dead ends: 245 [2024-11-08 16:56:51,513 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 16:56:51,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2024-11-08 16:56:51,519 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 190 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:56:51,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 328 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 7 Unknown, 0 Unchecked, 30.7s Time] [2024-11-08 16:56:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 16:56:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 110. [2024-11-08 16:56:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:56:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-08 16:56:51,536 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 121 [2024-11-08 16:56:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:56:51,537 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-08 16:56:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:56:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-08 16:56:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:56:51,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:56:51,539 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:51,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (6)] Ended with exit code 0 [2024-11-08 16:56:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:56:51,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:56:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:56:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1833536541, now seen corresponding path program 1 times [2024-11-08 16:56:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:56:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619565753] [2024-11-08 16:56:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:56:51,741 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 16:56:51,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:56:51,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:56:51,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (7)] Waiting until timeout for monitored process [2024-11-08 16:56:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:56:52,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 16:56:52,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:56:56,660 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 38 treesize of output 36 [2024-11-08 16:57:02,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:57:02,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 16:57:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:57:02,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:57:02,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:57:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619565753] [2024-11-08 16:57:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619565753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:57:02,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:57:02,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:57:02,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932765807] [2024-11-08 16:57:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:57:02,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:57:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:57:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:57:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2024-11-08 16:57:02,549 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:57:13,422 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 16:57:17,859 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 16:57:22,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:57:27,076 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 16:57:35,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 16:57:40,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:57:44,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:57:53,525 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 47 DAG size of output: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:57:57,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:58:01,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:58:06,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:58:10,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:58:19,528 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:58:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:58:23,843 INFO L93 Difference]: Finished difference Result 248 states and 357 transitions. [2024-11-08 16:58:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:58:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:58:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:58:23,851 INFO L225 Difference]: With dead ends: 248 [2024-11-08 16:58:23,851 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 16:58:23,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2024-11-08 16:58:23,853 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 158 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:58:23,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 509 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 11 Unknown, 0 Unchecked, 58.9s Time] [2024-11-08 16:58:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 16:58:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2024-11-08 16:58:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:58:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-08 16:58:23,876 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 121 [2024-11-08 16:58:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:58:23,877 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-08 16:58:23,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:58:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-08 16:58:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:58:23,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:58:23,880 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:58:23,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (7)] Ended with exit code 0 [2024-11-08 16:58:24,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:58:24,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:58:24,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:58:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1035775661, now seen corresponding path program 1 times [2024-11-08 16:58:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:58:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087105812] [2024-11-08 16:58:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:58:24,083 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 16:58:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:58:24,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:58:24,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (8)] Waiting until timeout for monitored process [2024-11-08 16:58:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:58:24,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:58:24,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:58:27,289 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-08 16:58:27,289 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 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-08 16:58:27,589 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 28 treesize of output 23 [2024-11-08 16:58:27,807 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 46 treesize of output 26 [2024-11-08 16:58:28,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:58:28,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2024-11-08 16:58:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:58:28,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:58:28,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:58:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087105812] [2024-11-08 16:58:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087105812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:58:28,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:58:28,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:58:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873436652] [2024-11-08 16:58:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:58:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:58:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:58:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:58:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:58:28,144 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:58:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:58:32,085 INFO L93 Difference]: Finished difference Result 254 states and 365 transitions. [2024-11-08 16:58:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:58:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:58:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:58:32,088 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:58:32,088 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 16:58:32,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:58:32,090 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 171 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:58:32,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 473 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 16:58:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 16:58:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2024-11-08 16:58:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:58:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-08 16:58:32,124 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 122 [2024-11-08 16:58:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:58:32,125 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-08 16:58:32,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:58:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-08 16:58:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:58:32,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:58:32,129 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:58:32,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:58:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:58:32,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:58:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:58:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 632954350, now seen corresponding path program 1 times [2024-11-08 16:58:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:58:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252191491] [2024-11-08 16:58:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:58:32,332 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 16:58:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:58:32,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 16:58:32,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (9)] Waiting until timeout for monitored process [2024-11-08 16:58:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:58:32,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 16:58:32,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:58:35,367 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 16:58:35,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:58:36,538 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 24 treesize of output 12 [2024-11-08 16:58:37,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-08 16:58:37,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 16:58:37,877 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 41 treesize of output 39 [2024-11-08 16:58:42,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:58:42,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 38 [2024-11-08 16:58:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 56 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 16:58:42,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:58:43,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:58:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252191491] [2024-11-08 16:58:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252191491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:58:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451230505] [2024-11-08 16:58:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:58:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:58:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:58:43,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:58:43,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 16:58:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:58:43,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 16:58:43,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:58:46,642 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 16:58:48,060 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 31 treesize of output 26 [2024-11-08 16:58:49,064 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 39 treesize of output 37 [2024-11-08 16:58:50,299 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 57 treesize of output 40 [2024-11-08 16:58:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-11-08 16:58:55,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-11-08 16:59:00,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:59:00,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 52 [2024-11-08 16:59:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 197 proven. 113 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 16:59:00,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:59:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451230505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:59:00,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:59:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 22 [2024-11-08 16:59:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725723652] [2024-11-08 16:59:00,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:59:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 16:59:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:59:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 16:59:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=589, Unknown=3, NotChecked=0, Total=702 [2024-11-08 16:59:00,896 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2024-11-08 16:59:09,652 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 16:59:13,681 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 16:59:25,946 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 16:59:29,965 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 16:59:34,016 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 16:59:38,029 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 16:59:42,048 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 16:59:46,065 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 16:59:50,119 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 16:59:54,159 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 16:59:58,195 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 17:00:02,216 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 17:00:06,243 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 17:00:10,289 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 17:00:14,392 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 17:00:18,412 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 17:00:22,427 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 17:00:26,433 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 17:00:30,468 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 17:00:34,617 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 17:00:38,684 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 17:00:43,005 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 17:00:47,088 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 17:00:51,115 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 17:00:59,612 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 17:01:03,627 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 17:01:07,701 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 17:01:11,715 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 17:01:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:01:17,393 INFO L93 Difference]: Finished difference Result 381 states and 535 transitions. [2024-11-08 17:01:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 17:01:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 122 [2024-11-08 17:01:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:01:17,397 INFO L225 Difference]: With dead ends: 381 [2024-11-08 17:01:17,397 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 17:01:17,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=473, Invalid=1971, Unknown=6, NotChecked=0, Total=2450 [2024-11-08 17:01:17,400 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 759 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 273 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:01:17,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 521 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1498 Invalid, 28 Unknown, 0 Unchecked, 121.5s Time] [2024-11-08 17:01:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 17:01:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2024-11-08 17:01:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.360730593607306) internal successors, (298), 221 states have internal predecessors, (298), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:01:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2024-11-08 17:01:17,446 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 122 [2024-11-08 17:01:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:01:17,447 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2024-11-08 17:01:17,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2024-11-08 17:01:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2024-11-08 17:01:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:01:17,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:01:17,449 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:17,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (9)] Ended with exit code 0 [2024-11-08 17:01:17,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:01:17,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:01:17,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:01:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:01:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 773074054, now seen corresponding path program 1 times [2024-11-08 17:01:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:01:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844239952] [2024-11-08 17:01:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:01:17,851 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 17:01:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:01:17,852 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:01:17,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (11)] Waiting until timeout for monitored process [2024-11-08 17:01:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:01:18,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:01:18,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:01:23,857 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 38 treesize of output 36 [2024-11-08 17:01:28,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:01:28,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 17:01:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:01:29,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:01:29,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:01:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844239952] [2024-11-08 17:01:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844239952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:01:29,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:01:29,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:01:29,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815022247] [2024-11-08 17:01:29,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:01:29,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:01:29,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:01:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:01:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2024-11-08 17:01:29,287 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:01:39,293 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 17:01:43,518 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 17:01:47,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:01:51,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:01:56,000 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 17:02:00,223 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 17:02:04,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:02:09,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:02:13,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:02:17,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:02:21,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:02:31,115 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 47 DAG size of output: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:02:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:35,497 INFO L93 Difference]: Finished difference Result 572 states and 803 transitions. [2024-11-08 17:02:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:02:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:02:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:35,506 INFO L225 Difference]: With dead ends: 572 [2024-11-08 17:02:35,506 INFO L226 Difference]: Without dead ends: 319 [2024-11-08 17:02:35,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2024-11-08 17:02:35,510 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 162 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:35,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 498 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 11 Unknown, 0 Unchecked, 56.2s Time] [2024-11-08 17:02:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-08 17:02:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 256. [2024-11-08 17:02:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.360730593607306) internal successors, (298), 221 states have internal predecessors, (298), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:02:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2024-11-08 17:02:35,564 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 122 [2024-11-08 17:02:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:35,565 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2024-11-08 17:02:35,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:02:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2024-11-08 17:02:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:02:35,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:35,567 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:02:35,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (11)] Ended with exit code 0 [2024-11-08 17:02:35,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:02:35,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:35,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash -631380410, now seen corresponding path program 1 times [2024-11-08 17:02:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:02:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051393584] [2024-11-08 17:02:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:35,769 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 17:02:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:02:35,771 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:02:35,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (12)] Waiting until timeout for monitored process [2024-11-08 17:02:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:36,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 17:02:36,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:40,738 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 35 treesize of output 44 [2024-11-08 17:02:45,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:02:45,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 24 [2024-11-08 17:02:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:02:46,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:02:46,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:02:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051393584] [2024-11-08 17:02:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051393584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:02:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162462301] [2024-11-08 17:02:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:02:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:02:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:02:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2024-11-08 17:02:46,170 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:02:55,866 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 17:03:00,199 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 17:03:04,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:03:08,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:12,868 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 17:03:17,224 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 17:03:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:26,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:03:30,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:35,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:03:39,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:48,502 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 52 DAG size of output: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:03:57,507 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 56 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:04:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:01,273 INFO L93 Difference]: Finished difference Result 572 states and 803 transitions. [2024-11-08 17:04:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:04:01,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:04:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:01,278 INFO L225 Difference]: With dead ends: 572 [2024-11-08 17:04:01,278 INFO L226 Difference]: Without dead ends: 319 [2024-11-08 17:04:01,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2024-11-08 17:04:01,280 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 156 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:01,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 561 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 979 Invalid, 11 Unknown, 0 Unchecked, 56.8s Time] [2024-11-08 17:04:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-08 17:04:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 256. [2024-11-08 17:04:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.360730593607306) internal successors, (298), 221 states have internal predecessors, (298), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:04:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2024-11-08 17:04:01,329 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 122 [2024-11-08 17:04:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2024-11-08 17:04:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:04:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2024-11-08 17:04:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:04:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:01,331 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:04:01,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (12)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:01,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:04:01,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:04:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1581319890, now seen corresponding path program 1 times [2024-11-08 17:04:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:04:01,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957212760] [2024-11-08 17:04:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:01,533 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 17:04:01,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:04:01,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:04:01,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (13)] Waiting until timeout for monitored process [2024-11-08 17:04:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:02,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:04:02,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:07,217 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 38 treesize of output 36 [2024-11-08 17:04:12,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:04:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 17:04:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:04:12,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:04:12,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:04:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957212760] [2024-11-08 17:04:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957212760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:04:12,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219479066] [2024-11-08 17:04:12,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:04:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:04:12,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:04:12,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2024-11-08 17:04:12,843 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:04:22,659 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 17:04:26,970 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 17:04:31,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:04:35,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:39,416 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 17:04:43,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:04:47,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:04:51,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:56,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:00,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:05:05,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:15,266 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 52 DAG size of output: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:05:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:05:18,779 INFO L93 Difference]: Finished difference Result 572 states and 803 transitions. [2024-11-08 17:05:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:05:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2024-11-08 17:05:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:05:18,791 INFO L225 Difference]: With dead ends: 572 [2024-11-08 17:05:18,791 INFO L226 Difference]: Without dead ends: 319 [2024-11-08 17:05:18,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2024-11-08 17:05:18,792 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 160 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:05:18,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 498 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 11 Unknown, 0 Unchecked, 56.1s Time] [2024-11-08 17:05:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-08 17:05:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 256. [2024-11-08 17:05:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.360730593607306) internal successors, (298), 221 states have internal predecessors, (298), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:05:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2024-11-08 17:05:18,826 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 123 [2024-11-08 17:05:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:05:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2024-11-08 17:05:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:05:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2024-11-08 17:05:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:05:18,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:05:18,827 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:05:18,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (13)] Forceful destruction successful, exit code 0 [2024-11-08 17:05:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:05:19,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:05:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:05:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1433783728, now seen corresponding path program 1 times [2024-11-08 17:05:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:05:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762683771] [2024-11-08 17:05:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:19,029 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 17:05:19,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:05:19,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 17:05:19,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/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 (14)] Waiting until timeout for monitored process [2024-11-08 17:05:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:19,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 17:05:19,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:19,501 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 52 treesize of output 51 [2024-11-08 17:05:20,020 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 91 treesize of output 74 [2024-11-08 17:05:21,256 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 91 treesize of output 74 [2024-11-08 17:05:22,321 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 91 treesize of output 74 [2024-11-08 17:05:23,598 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 95 treesize of output 76 [2024-11-08 17:05:24,897 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 92 treesize of output 73 [2024-11-08 17:05:26,069 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 89 treesize of output 72 [2024-11-08 17:05:27,854 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 89 treesize of output 72 [2024-11-08 17:05:38,204 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 93 treesize of output 76 [2024-11-08 17:05:51,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2024-11-08 17:05:54,916 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 101 treesize of output 83 [2024-11-08 17:05:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 32 proven. 312 refuted. 16 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 17:05:55,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:56,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:05:56,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762683771] [2024-11-08 17:05:56,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762683771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:56,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912590310] [2024-11-08 17:05:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:05:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:05:56,832 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:05:56,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c23b1ba7-acf2-46d6-8438-145a772c91f6/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:05:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:57,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:05:57,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:57,182 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 79 treesize of output 78 [2024-11-08 17:06:02,082 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 98 treesize of output 93 [2024-11-08 17:06:08,231 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 104 treesize of output 97 [2024-11-08 17:06:14,659 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 110 treesize of output 101 [2024-11-08 17:06:21,329 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 116 treesize of output 105 [2024-11-08 17:06:27,646 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 117 treesize of output 104 [2024-11-08 17:06:41,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 117 treesize of output 104