./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:48:38,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:48:38,154 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:48:38,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:48:38,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:48:38,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:48:38,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:48:38,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:48:38,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:48:38,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:48:38,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:48:38,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:48:38,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:48:38,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:48:38,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:48:38,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:48:38,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:48:38,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:48:38,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:48:38,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:48:38,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:48:38,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:48:38,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:48:38,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:48:38,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:48:38,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:48:38,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:48:38,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:48:38,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:48:38,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:48:38,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:48:38,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:48:38,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:38,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:48:38,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:48:38,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:48:38,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:48:38,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:48:38,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:48:38,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:48:38,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:48:38,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:48:38,220 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2024-11-08 17:48:38,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:48:38,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:48:38,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:48:38,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:48:38,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:48:38,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i Unable to find full path for "g++" [2024-11-08 17:48:41,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:48:41,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:48:41,620 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2024-11-08 17:48:41,635 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/da6ac8b22/3ca7d08559d54e04bf8fa50dee127ab6/FLAG59987ed21 [2024-11-08 17:48:41,665 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/da6ac8b22/3ca7d08559d54e04bf8fa50dee127ab6 [2024-11-08 17:48:41,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:48:41,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:48:41,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:41,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:48:41,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:48:41,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:41" (1/1) ... [2024-11-08 17:48:41,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cab35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:41, skipping insertion in model container [2024-11-08 17:48:41,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:41" (1/1) ... [2024-11-08 17:48:41,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:48:42,032 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2024-11-08 17:48:42,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:42,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:48:42,192 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2024-11-08 17:48:42,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:42,285 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:48:42,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42 WrapperNode [2024-11-08 17:48:42,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:42,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:42,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:48:42,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:48:42,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,382 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2024-11-08 17:48:42,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:42,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:48:42,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:48:42,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:48:42,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,417 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 17:48:42,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:48:42,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:48:42,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:48:42,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:48:42,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (1/1) ... [2024-11-08 17:48:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:42,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:48:42,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:48:42,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:48:42,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:48:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 17:48:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 17:48:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 17:48:42,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 17:48:42,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 17:48:42,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 17:48:42,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:48:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:48:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 17:48:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:48:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:48:42,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:48:42,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:48:43,757 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 17:48:43,757 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:48:43,776 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:48:43,777 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:48:43,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:43 BoogieIcfgContainer [2024-11-08 17:48:43,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:48:43,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:48:43,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:48:43,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:48:43,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:48:41" (1/3) ... [2024-11-08 17:48:43,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aba6121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:43, skipping insertion in model container [2024-11-08 17:48:43,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:42" (2/3) ... [2024-11-08 17:48:43,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aba6121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:43, skipping insertion in model container [2024-11-08 17:48:43,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:43" (3/3) ... [2024-11-08 17:48:43,790 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2024-11-08 17:48:43,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:48:43,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:48:43,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:48:43,928 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;@19cefff6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:48:43,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:48:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:48:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:48:43,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:43,961 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:43,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:43,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2067378053, now seen corresponding path program 1 times [2024-11-08 17:48:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604065259] [2024-11-08 17:48:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:48:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:48:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:48:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:48:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:48:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:48:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:48:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:48:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:48:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:48:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:48:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:48:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:48:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:48:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:48:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:48:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:48:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:48:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604065259] [2024-11-08 17:48:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604065259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:44,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:44,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:48:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110769268] [2024-11-08 17:48:44,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:44,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:48:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:48:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:48:44,556 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:48:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:44,592 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-08 17:48:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:48:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 17:48:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:44,609 INFO L225 Difference]: With dead ends: 217 [2024-11-08 17:48:44,610 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:48:44,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 17:48:44,616 INFO L432 NwaCegarLoop]: 155 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, 155 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 17:48:44,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:48:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:48:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 17:48:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:48:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-08 17:48:44,686 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-08 17:48:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:44,686 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-08 17:48:44,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:48:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-08 17:48:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:48:44,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:44,693 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:48:44,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:44,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash -916448795, now seen corresponding path program 1 times [2024-11-08 17:48:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550882244] [2024-11-08 17:48:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:48:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:48:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:48:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:48:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:48:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:48:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:48:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:48:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:48:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:48:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:48:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:48:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:48:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:48:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:48:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:48:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:48:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:48:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550882244] [2024-11-08 17:48:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550882244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:45,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:48:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053538532] [2024-11-08 17:48:45,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:48:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:48:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:48:45,832 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:48:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:45,893 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2024-11-08 17:48:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:48:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-08 17:48:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:45,897 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:48:45,900 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:48:45,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:48:45,903 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:48:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:48:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 17:48:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:48:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-08 17:48:45,928 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2024-11-08 17:48:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:45,935 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-08 17:48:45,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:48:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-08 17:48:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:48:45,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:45,938 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:48:45,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:45,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1937517149, now seen corresponding path program 1 times [2024-11-08 17:48:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601134665] [2024-11-08 17:48:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:48:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:48:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:48:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:48:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:48:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:48:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:48:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:48:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:48:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:48:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:48:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:48:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:48:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:48:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:48:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:48:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:48:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:48:49,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601134665] [2024-11-08 17:48:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601134665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:49,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:49,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:48:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439876208] [2024-11-08 17:48:49,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:49,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:48:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:48:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:48:49,535 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:48:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:50,493 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2024-11-08 17:48:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:48:50,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 17:48:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:50,498 INFO L225 Difference]: With dead ends: 219 [2024-11-08 17:48:50,498 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:48:50,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:48:50,501 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 85 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:50,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 404 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:48:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:48:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 17:48:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:48:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-08 17:48:50,530 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2024-11-08 17:48:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:50,531 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-08 17:48:50,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:48:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-08 17:48:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:48:50,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:50,537 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:48:50,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1236452571, now seen corresponding path program 1 times [2024-11-08 17:48:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504758114] [2024-11-08 17:48:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:48:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:48:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:48:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:48:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:48:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:48:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:48:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:48:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:48:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:48:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:48:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:48:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:48:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:48:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:48:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:48:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:48:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:48:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:55,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504758114] [2024-11-08 17:48:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504758114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:55,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:48:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293844369] [2024-11-08 17:48:55,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:48:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:48:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:48:55,750 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:48:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:57,046 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2024-11-08 17:48:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:48:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2024-11-08 17:48:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:57,050 INFO L225 Difference]: With dead ends: 336 [2024-11-08 17:48:57,051 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 17:48:57,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:48:57,053 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 147 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:57,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 408 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:48:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 17:48:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-11-08 17:48:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:48:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2024-11-08 17:48:57,100 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2024-11-08 17:48:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:57,101 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2024-11-08 17:48:57,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:48:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2024-11-08 17:48:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 17:48:57,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:57,105 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:48:57,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -189395572, now seen corresponding path program 1 times [2024-11-08 17:48:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:57,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908600334] [2024-11-08 17:48:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908600334] [2024-11-08 17:49:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908600334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:49:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474655577] [2024-11-08 17:49:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:01,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:49:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:49:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:49:01,911 INFO L87 Difference]: Start difference. First operand 219 states and 308 transitions. Second operand has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:03,554 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2024-11-08 17:49:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:49:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 142 [2024-11-08 17:49:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:03,559 INFO L225 Difference]: With dead ends: 330 [2024-11-08 17:49:03,561 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 17:49:03,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:49:03,567 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 184 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:03,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 409 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:49:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 17:49:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2024-11-08 17:49:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:49:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-08 17:49:03,600 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2024-11-08 17:49:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:03,601 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-08 17:49:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-08 17:49:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:49:03,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:03,604 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:49:03,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1196359270, now seen corresponding path program 1 times [2024-11-08 17:49:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72031582] [2024-11-08 17:49:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72031582] [2024-11-08 17:49:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72031582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451557156] [2024-11-08 17:49:04,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:04,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:04,088 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:04,124 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2024-11-08 17:49:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:04,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-08 17:49:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:04,128 INFO L225 Difference]: With dead ends: 221 [2024-11-08 17:49:04,128 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 17:49:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:04,130 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:04,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 17:49:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 17:49:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:49:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-11-08 17:49:04,161 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2024-11-08 17:49:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-11-08 17:49:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-11-08 17:49:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:49:04,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:04,167 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:49:04,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1783165284, now seen corresponding path program 1 times [2024-11-08 17:49:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050454183] [2024-11-08 17:49:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050454183] [2024-11-08 17:49:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050454183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:49:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181646123] [2024-11-08 17:49:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:06,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:49:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:49:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:49:06,267 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:07,596 INFO L93 Difference]: Finished difference Result 299 states and 409 transitions. [2024-11-08 17:49:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:49:07,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-11-08 17:49:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:07,599 INFO L225 Difference]: With dead ends: 299 [2024-11-08 17:49:07,599 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 17:49:07,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:49:07,601 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 86 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:07,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 970 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:49:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 17:49:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-08 17:49:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:49:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2024-11-08 17:49:07,639 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2024-11-08 17:49:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2024-11-08 17:49:07,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2024-11-08 17:49:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:49:07,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:07,644 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:49:07,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1278741251, now seen corresponding path program 1 times [2024-11-08 17:49:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732830060] [2024-11-08 17:49:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732830060] [2024-11-08 17:49:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732830060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:10,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:10,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:49:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814796953] [2024-11-08 17:49:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:10,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:49:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:49:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:49:10,543 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:12,703 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2024-11-08 17:49:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:49:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-08 17:49:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:12,709 INFO L225 Difference]: With dead ends: 607 [2024-11-08 17:49:12,709 INFO L226 Difference]: Without dead ends: 423 [2024-11-08 17:49:12,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:12,712 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:12,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 616 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:49:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-08 17:49:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2024-11-08 17:49:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2024-11-08 17:49:12,789 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2024-11-08 17:49:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:12,790 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2024-11-08 17:49:12,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2024-11-08 17:49:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:49:12,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:12,794 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:49:12,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1979805829, now seen corresponding path program 1 times [2024-11-08 17:49:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686871365] [2024-11-08 17:49:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:15,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686871365] [2024-11-08 17:49:15,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686871365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:15,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:49:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069898259] [2024-11-08 17:49:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:15,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:49:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:15,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:49:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:49:15,119 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:16,114 INFO L93 Difference]: Finished difference Result 947 states and 1296 transitions. [2024-11-08 17:49:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:49:16,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-08 17:49:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:16,120 INFO L225 Difference]: With dead ends: 947 [2024-11-08 17:49:16,121 INFO L226 Difference]: Without dead ends: 534 [2024-11-08 17:49:16,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:49:16,123 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 49 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:16,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 613 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:49:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-08 17:49:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2024-11-08 17:49:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2941176470588236) internal successors, (484), 377 states have internal predecessors, (484), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 600 transitions. [2024-11-08 17:49:16,203 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 600 transitions. Word has length 146 [2024-11-08 17:49:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 600 transitions. [2024-11-08 17:49:16,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 600 transitions. [2024-11-08 17:49:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:49:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:16,207 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:49:16,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 461092801, now seen corresponding path program 1 times [2024-11-08 17:49:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657490412] [2024-11-08 17:49:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:18,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657490412] [2024-11-08 17:49:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657490412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:49:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847627013] [2024-11-08 17:49:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:18,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:49:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:49:18,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:49:18,448 INFO L87 Difference]: Start difference. First operand 442 states and 600 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:19,545 INFO L93 Difference]: Finished difference Result 973 states and 1321 transitions. [2024-11-08 17:49:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:49:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-08 17:49:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:19,552 INFO L225 Difference]: With dead ends: 973 [2024-11-08 17:49:19,552 INFO L226 Difference]: Without dead ends: 534 [2024-11-08 17:49:19,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:49:19,555 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 47 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:19,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 680 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:49:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-08 17:49:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2024-11-08 17:49:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2834224598930482) internal successors, (480), 377 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 596 transitions. [2024-11-08 17:49:19,617 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 596 transitions. Word has length 146 [2024-11-08 17:49:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 596 transitions. [2024-11-08 17:49:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 596 transitions. [2024-11-08 17:49:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:49:19,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:19,626 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:49:19,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:19,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1162157379, now seen corresponding path program 1 times [2024-11-08 17:49:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704409056] [2024-11-08 17:49:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704409056] [2024-11-08 17:49:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704409056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:49:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846631489] [2024-11-08 17:49:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:22,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:49:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:49:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:49:22,046 INFO L87 Difference]: Start difference. First operand 442 states and 596 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:49:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:23,684 INFO L93 Difference]: Finished difference Result 913 states and 1231 transitions. [2024-11-08 17:49:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:49:23,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-08 17:49:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:23,688 INFO L225 Difference]: With dead ends: 913 [2024-11-08 17:49:23,688 INFO L226 Difference]: Without dead ends: 474 [2024-11-08 17:49:23,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:23,690 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 50 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:23,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1065 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:49:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-08 17:49:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 443. [2024-11-08 17:49:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 375 states have (on average 1.28) internal successors, (480), 378 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 596 transitions. [2024-11-08 17:49:23,749 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 596 transitions. Word has length 146 [2024-11-08 17:49:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:23,749 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 596 transitions. [2024-11-08 17:49:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:49:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 596 transitions. [2024-11-08 17:49:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 17:49:23,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:23,753 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:49:23,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:23,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1809853966, now seen corresponding path program 1 times [2024-11-08 17:49:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:23,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976122955] [2024-11-08 17:49:23,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976122955] [2024-11-08 17:49:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976122955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036791728] [2024-11-08 17:49:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:24,071 INFO L87 Difference]: Start difference. First operand 443 states and 596 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:24,158 INFO L93 Difference]: Finished difference Result 898 states and 1209 transitions. [2024-11-08 17:49:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 17:49:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:24,164 INFO L225 Difference]: With dead ends: 898 [2024-11-08 17:49:24,164 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 17:49:24,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:24,166 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:24,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 17:49:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-11-08 17:49:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 390 states have (on average 1.2692307692307692) internal successors, (495), 393 states have internal predecessors, (495), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 611 transitions. [2024-11-08 17:49:24,250 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 611 transitions. Word has length 147 [2024-11-08 17:49:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 611 transitions. [2024-11-08 17:49:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 611 transitions. [2024-11-08 17:49:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 17:49:24,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:24,254 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:49:24,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1423777832, now seen corresponding path program 1 times [2024-11-08 17:49:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369299364] [2024-11-08 17:49:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:24,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369299364] [2024-11-08 17:49:24,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369299364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:24,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:24,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:49:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373638122] [2024-11-08 17:49:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:24,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:49:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:49:24,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:49:24,618 INFO L87 Difference]: Start difference. First operand 458 states and 611 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:24,721 INFO L93 Difference]: Finished difference Result 933 states and 1244 transitions. [2024-11-08 17:49:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:49:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 17:49:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:24,728 INFO L225 Difference]: With dead ends: 933 [2024-11-08 17:49:24,728 INFO L226 Difference]: Without dead ends: 478 [2024-11-08 17:49:24,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:49:24,731 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:24,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-08 17:49:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 472. [2024-11-08 17:49:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 404 states have (on average 1.25990099009901) internal successors, (509), 407 states have internal predecessors, (509), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 17:49:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 625 transitions. [2024-11-08 17:49:24,791 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 625 transitions. Word has length 147 [2024-11-08 17:49:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:24,792 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 625 transitions. [2024-11-08 17:49:24,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 625 transitions. [2024-11-08 17:49:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:49:24,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:24,795 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:49:24,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:24,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1105015850, now seen corresponding path program 1 times [2024-11-08 17:49:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967110479] [2024-11-08 17:49:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967110479] [2024-11-08 17:49:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967110479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:31,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:49:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660693586] [2024-11-08 17:49:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:31,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:49:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:49:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:49:31,212 INFO L87 Difference]: Start difference. First operand 472 states and 625 transitions. Second operand has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:49:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:37,974 INFO L93 Difference]: Finished difference Result 733 states and 967 transitions. [2024-11-08 17:49:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:49:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2024-11-08 17:49:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:37,979 INFO L225 Difference]: With dead ends: 733 [2024-11-08 17:49:37,979 INFO L226 Difference]: Without dead ends: 517 [2024-11-08 17:49:37,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:49:37,982 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 287 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:37,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 973 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 17:49:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-08 17:49:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 260. [2024-11-08 17:49:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:49:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 341 transitions. [2024-11-08 17:49:38,022 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 341 transitions. Word has length 148 [2024-11-08 17:49:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:38,023 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 341 transitions. [2024-11-08 17:49:38,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:49:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 341 transitions. [2024-11-08 17:49:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:49:38,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:38,026 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:49:38,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1942373943, now seen corresponding path program 1 times [2024-11-08 17:49:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851675401] [2024-11-08 17:49:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851675401] [2024-11-08 17:49:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851675401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:49:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317605805] [2024-11-08 17:49:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:40,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:49:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:49:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:49:40,654 INFO L87 Difference]: Start difference. First operand 260 states and 341 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:41,829 INFO L93 Difference]: Finished difference Result 507 states and 660 transitions. [2024-11-08 17:49:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:49:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2024-11-08 17:49:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:41,834 INFO L225 Difference]: With dead ends: 507 [2024-11-08 17:49:41,834 INFO L226 Difference]: Without dead ends: 505 [2024-11-08 17:49:41,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:49:41,835 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 88 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:41,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 977 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:49:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-08 17:49:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 381. [2024-11-08 17:49:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 342 states have (on average 1.2543859649122806) internal successors, (429), 345 states have internal predecessors, (429), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:49:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 493 transitions. [2024-11-08 17:49:41,890 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 493 transitions. Word has length 149 [2024-11-08 17:49:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 493 transitions. [2024-11-08 17:49:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 17:49:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 493 transitions. [2024-11-08 17:49:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:49:41,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:41,894 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:49:41,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1064027339, now seen corresponding path program 1 times [2024-11-08 17:49:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068148745] [2024-11-08 17:49:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:46,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068148745] [2024-11-08 17:49:46,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068148745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:49:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099550737] [2024-11-08 17:49:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:46,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:49:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:49:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:49:46,175 INFO L87 Difference]: Start difference. First operand 381 states and 493 transitions. Second operand has 17 states, 14 states have (on average 4.428571428571429) internal successors, (62), 17 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:49:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:50,191 INFO L93 Difference]: Finished difference Result 1217 states and 1573 transitions. [2024-11-08 17:49:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:49:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.428571428571429) internal successors, (62), 17 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2024-11-08 17:49:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:50,197 INFO L225 Difference]: With dead ends: 1217 [2024-11-08 17:49:50,197 INFO L226 Difference]: Without dead ends: 839 [2024-11-08 17:49:50,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:49:50,200 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 359 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:50,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 850 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 17:49:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-08 17:49:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 740. [2024-11-08 17:49:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 661 states have (on average 1.2556732223903178) internal successors, (830), 666 states have internal predecessors, (830), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 17:49:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 958 transitions. [2024-11-08 17:49:50,314 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 958 transitions. Word has length 149 [2024-11-08 17:49:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:50,315 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 958 transitions. [2024-11-08 17:49:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.428571428571429) internal successors, (62), 17 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:49:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 958 transitions. [2024-11-08 17:49:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:49:50,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:50,319 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:49:50,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 905435107, now seen corresponding path program 1 times [2024-11-08 17:49:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466572614] [2024-11-08 17:49:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:49:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466572614] [2024-11-08 17:49:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466572614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:49:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082521385] [2024-11-08 17:49:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:49:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:49:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:49:50,621 INFO L87 Difference]: Start difference. First operand 740 states and 958 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:50,757 INFO L93 Difference]: Finished difference Result 1545 states and 1991 transitions. [2024-11-08 17:49:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:49:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-08 17:49:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:50,764 INFO L225 Difference]: With dead ends: 1545 [2024-11-08 17:49:50,764 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 17:49:50,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:49:50,767 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:50,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:49:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 17:49:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 750. [2024-11-08 17:49:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 671 states have (on average 1.2518628912071534) internal successors, (840), 676 states have internal predecessors, (840), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 17:49:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 968 transitions. [2024-11-08 17:49:50,881 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 968 transitions. Word has length 149 [2024-11-08 17:49:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 968 transitions. [2024-11-08 17:49:50,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:49:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 968 transitions. [2024-11-08 17:49:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:49:50,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:50,885 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:49:50,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:50,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -327447901, now seen corresponding path program 1 times [2024-11-08 17:49:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955614302] [2024-11-08 17:49:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:49:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:49:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:49:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:49:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:49:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:49:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:49:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:49:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:49:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:49:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955614302] [2024-11-08 17:49:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955614302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:49:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546595230] [2024-11-08 17:49:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:52,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:49:52,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:49:52,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:49:52,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:49:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-08 17:49:53,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:49:53,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-11-08 17:49:53,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 17:49:53,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 17:49:53,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:53,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-08 17:49:53,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:53,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-08 17:49:54,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-08 17:49:54,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-08 17:49:54,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-08 17:49:54,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,539 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 39 treesize of output 26 [2024-11-08 17:49:54,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 17:49:54,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:54,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 17:49:55,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:55,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2024-11-08 17:49:55,146 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 78 treesize of output 54 [2024-11-08 17:49:55,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 104 [2024-11-08 17:49:55,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 63 [2024-11-08 17:49:55,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:55,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 85 [2024-11-08 17:49:55,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:49:55,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 92 [2024-11-08 17:49:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 87 proven. 315 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-08 17:49:55,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:49:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:49:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546595230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:49:56,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:49:56,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 27 [2024-11-08 17:49:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124494681] [2024-11-08 17:49:56,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:49:56,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 17:49:56,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:56,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 17:49:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:49:56,589 INFO L87 Difference]: Start difference. First operand 750 states and 968 transitions. Second operand has 27 states, 24 states have (on average 6.333333333333333) internal successors, (152), 27 states have internal predecessors, (152), 9 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 6 states have call predecessors, (52), 9 states have call successors, (52) [2024-11-08 17:50:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:00,566 INFO L93 Difference]: Finished difference Result 1713 states and 2199 transitions. [2024-11-08 17:50:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 17:50:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.333333333333333) internal successors, (152), 27 states have internal predecessors, (152), 9 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 6 states have call predecessors, (52), 9 states have call successors, (52) Word has length 151 [2024-11-08 17:50:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:00,572 INFO L225 Difference]: With dead ends: 1713 [2024-11-08 17:50:00,573 INFO L226 Difference]: Without dead ends: 966 [2024-11-08 17:50:00,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=476, Invalid=2386, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 17:50:00,578 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 574 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:00,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 872 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:50:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-08 17:50:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 729. [2024-11-08 17:50:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 629 states have (on average 1.2432432432432432) internal successors, (782), 634 states have internal predecessors, (782), 78 states have call successors, (78), 21 states have call predecessors, (78), 21 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:50:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 938 transitions. [2024-11-08 17:50:00,702 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 938 transitions. Word has length 151 [2024-11-08 17:50:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:00,703 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 938 transitions. [2024-11-08 17:50:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.333333333333333) internal successors, (152), 27 states have internal predecessors, (152), 9 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 6 states have call predecessors, (52), 9 states have call successors, (52) [2024-11-08 17:50:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 938 transitions. [2024-11-08 17:50:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:50:00,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:00,705 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:50:00,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 17:50:00,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1775247193, now seen corresponding path program 1 times [2024-11-08 17:50:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573812589] [2024-11-08 17:50:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:50:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573812589] [2024-11-08 17:50:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573812589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:50:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86109542] [2024-11-08 17:50:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:03,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:50:03,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:50:03,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:50:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:03,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 17:50:03,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:03,844 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 31 treesize of output 15 [2024-11-08 17:50:03,891 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 31 treesize of output 15 [2024-11-08 17:50:03,943 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 31 treesize of output 15 [2024-11-08 17:50:03,998 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 31 treesize of output 15 [2024-11-08 17:50:04,035 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 31 treesize of output 15 [2024-11-08 17:50:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 17:50:04,119 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 31 treesize of output 15 [2024-11-08 17:50:04,172 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 31 treesize of output 15 [2024-11-08 17:50:04,217 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 31 treesize of output 15 [2024-11-08 17:50:04,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:04,276 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-11-08 17:50:04,348 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 85 treesize of output 63 [2024-11-08 17:50:04,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:04,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 115 [2024-11-08 17:50:04,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:04,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 63 [2024-11-08 17:50:04,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:04,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 82 [2024-11-08 17:50:04,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 82 [2024-11-08 17:50:05,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:05,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 40 [2024-11-08 17:50:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:50:05,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:50:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:50:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86109542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:50:05,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:50:05,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 23 [2024-11-08 17:50:05,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588889238] [2024-11-08 17:50:05,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:50:05,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:50:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:50:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:50:05,718 INFO L87 Difference]: Start difference. First operand 729 states and 938 transitions. Second operand has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 17:50:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:09,664 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2024-11-08 17:50:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 17:50:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) Word has length 151 [2024-11-08 17:50:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:09,669 INFO L225 Difference]: With dead ends: 1418 [2024-11-08 17:50:09,670 INFO L226 Difference]: Without dead ends: 759 [2024-11-08 17:50:09,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=431, Invalid=2119, Unknown=0, NotChecked=0, Total=2550 [2024-11-08 17:50:09,673 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 717 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:09,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 727 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 17:50:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-11-08 17:50:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 710. [2024-11-08 17:50:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 603 states have (on average 1.2321724709784412) internal successors, (743), 608 states have internal predecessors, (743), 78 states have call successors, (78), 28 states have call predecessors, (78), 28 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:50:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 899 transitions. [2024-11-08 17:50:09,810 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 899 transitions. Word has length 151 [2024-11-08 17:50:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 899 transitions. [2024-11-08 17:50:09,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 17:50:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 899 transitions. [2024-11-08 17:50:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 17:50:09,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:09,813 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:50:10,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:10,014 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:10,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -900180424, now seen corresponding path program 1 times [2024-11-08 17:50:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129453905] [2024-11-08 17:50:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:50:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129453905] [2024-11-08 17:50:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129453905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:50:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803229578] [2024-11-08 17:50:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:12,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:50:12,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:50:12,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:50:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:13,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:50:13,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:13,249 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 31 treesize of output 15 [2024-11-08 17:50:13,280 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 31 treesize of output 15 [2024-11-08 17:50:13,312 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 31 treesize of output 15 [2024-11-08 17:50:13,352 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 31 treesize of output 15 [2024-11-08 17:50:13,391 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 31 treesize of output 15 [2024-11-08 17:50:13,431 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 31 treesize of output 15 [2024-11-08 17:50:13,494 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 31 treesize of output 24 [2024-11-08 17:50:13,561 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 85 treesize of output 63 [2024-11-08 17:50:13,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:13,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 101 [2024-11-08 17:50:13,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2024-11-08 17:50:13,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:13,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 73 [2024-11-08 17:50:14,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 40 [2024-11-08 17:50:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 311 proven. 30 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-08 17:50:14,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:50:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:50:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803229578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:50:14,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:50:14,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 21 [2024-11-08 17:50:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916534064] [2024-11-08 17:50:14,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:50:14,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:50:14,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:50:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:50:14,804 INFO L87 Difference]: Start difference. First operand 710 states and 899 transitions. Second operand has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) [2024-11-08 17:50:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:20,021 INFO L93 Difference]: Finished difference Result 1368 states and 1702 transitions. [2024-11-08 17:50:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-08 17:50:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) Word has length 152 [2024-11-08 17:50:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:20,028 INFO L225 Difference]: With dead ends: 1368 [2024-11-08 17:50:20,028 INFO L226 Difference]: Without dead ends: 732 [2024-11-08 17:50:20,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 336 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=939, Invalid=4463, Unknown=0, NotChecked=0, Total=5402 [2024-11-08 17:50:20,033 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1368 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:20,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 657 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:50:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-08 17:50:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 663. [2024-11-08 17:50:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 551 states have (on average 1.1996370235934664) internal successors, (661), 556 states have internal predecessors, (661), 78 states have call successors, (78), 33 states have call predecessors, (78), 33 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:50:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 817 transitions. [2024-11-08 17:50:20,224 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 817 transitions. Word has length 152 [2024-11-08 17:50:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:20,225 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 817 transitions. [2024-11-08 17:50:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) [2024-11-08 17:50:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 817 transitions. [2024-11-08 17:50:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:50:20,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:20,228 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:50:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:20,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1500175278, now seen corresponding path program 1 times [2024-11-08 17:50:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523848865] [2024-11-08 17:50:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:50:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523848865] [2024-11-08 17:50:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523848865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:22,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:50:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482759589] [2024-11-08 17:50:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:22,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:50:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:50:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:50:22,335 INFO L87 Difference]: Start difference. First operand 663 states and 817 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:24,161 INFO L93 Difference]: Finished difference Result 1347 states and 1656 transitions. [2024-11-08 17:50:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:50:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-08 17:50:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:24,167 INFO L225 Difference]: With dead ends: 1347 [2024-11-08 17:50:24,168 INFO L226 Difference]: Without dead ends: 999 [2024-11-08 17:50:24,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:50:24,170 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 90 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:24,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1350 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:50:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-11-08 17:50:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 981. [2024-11-08 17:50:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 827 states have (on average 1.2019347037484884) internal successors, (994), 836 states have internal predecessors, (994), 106 states have call successors, (106), 47 states have call predecessors, (106), 47 states have return successors, (106), 97 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:50:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1206 transitions. [2024-11-08 17:50:24,347 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1206 transitions. Word has length 153 [2024-11-08 17:50:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:24,347 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1206 transitions. [2024-11-08 17:50:24,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1206 transitions. [2024-11-08 17:50:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 17:50:24,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:24,349 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:50:24,349 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1656085434, now seen corresponding path program 1 times [2024-11-08 17:50:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066697569] [2024-11-08 17:50:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-08 17:50:27,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066697569] [2024-11-08 17:50:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066697569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:50:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249076563] [2024-11-08 17:50:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:50:27,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:50:27,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:50:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 17:50:28,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:28,771 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 42 treesize of output 20 [2024-11-08 17:50:29,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:29,078 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-08 17:50:29,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:29,216 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-08 17:50:29,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:29,324 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-08 17:50:29,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:29,427 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-08 17:50:29,607 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 53 treesize of output 34 [2024-11-08 17:50:30,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:30,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2024-11-08 17:50:30,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:50:30,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2024-11-08 17:50:30,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2024-11-08 17:50:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 379 proven. 120 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 17:50:30,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:50:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 93 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-08 17:50:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249076563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:50:33,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:50:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 43 [2024-11-08 17:50:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014065665] [2024-11-08 17:50:33,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:50:33,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 17:50:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 17:50:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 17:50:33,570 INFO L87 Difference]: Start difference. First operand 981 states and 1206 transitions. Second operand has 43 states, 32 states have (on average 4.78125) internal successors, (153), 41 states have internal predecessors, (153), 21 states have call successors, (50), 5 states have call predecessors, (50), 11 states have return successors, (51), 12 states have call predecessors, (51), 21 states have call successors, (51) [2024-11-08 17:50:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:37,147 INFO L93 Difference]: Finished difference Result 1365 states and 1658 transitions. [2024-11-08 17:50:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 17:50:37,148 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 32 states have (on average 4.78125) internal successors, (153), 41 states have internal predecessors, (153), 21 states have call successors, (50), 5 states have call predecessors, (50), 11 states have return successors, (51), 12 states have call predecessors, (51), 21 states have call successors, (51) Word has length 154 [2024-11-08 17:50:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:37,151 INFO L225 Difference]: With dead ends: 1365 [2024-11-08 17:50:37,152 INFO L226 Difference]: Without dead ends: 462 [2024-11-08 17:50:37,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=502, Invalid=2360, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 17:50:37,155 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 586 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:37,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 682 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 17:50:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-08 17:50:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 369. [2024-11-08 17:50:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 297 states have (on average 1.1784511784511784) internal successors, (350), 299 states have internal predecessors, (350), 46 states have call successors, (46), 25 states have call predecessors, (46), 25 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:50:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 442 transitions. [2024-11-08 17:50:37,256 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 442 transitions. Word has length 154 [2024-11-08 17:50:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:37,257 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 442 transitions. [2024-11-08 17:50:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 32 states have (on average 4.78125) internal successors, (153), 41 states have internal predecessors, (153), 21 states have call successors, (50), 5 states have call predecessors, (50), 11 states have return successors, (51), 12 states have call predecessors, (51), 21 states have call successors, (51) [2024-11-08 17:50:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 442 transitions. [2024-11-08 17:50:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:37,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:37,259 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:50:37,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:50:37,459 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1439960868, now seen corresponding path program 1 times [2024-11-08 17:50:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:37,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076776351] [2024-11-08 17:50:37,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:37,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:50:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076776351] [2024-11-08 17:50:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076776351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:50:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631704638] [2024-11-08 17:50:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:39,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:50:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:50:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:50:39,700 INFO L87 Difference]: Start difference. First operand 369 states and 442 transitions. Second operand has 8 states, 5 states have (on average 13.6) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:50:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:40,634 INFO L93 Difference]: Finished difference Result 652 states and 783 transitions. [2024-11-08 17:50:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:50:40,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.6) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2024-11-08 17:50:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:40,638 INFO L225 Difference]: With dead ends: 652 [2024-11-08 17:50:40,638 INFO L226 Difference]: Without dead ends: 369 [2024-11-08 17:50:40,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:50:40,640 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:40,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 494 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:50:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-08 17:50:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-08 17:50:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 297 states have (on average 1.1683501683501682) internal successors, (347), 299 states have internal predecessors, (347), 46 states have call successors, (46), 25 states have call predecessors, (46), 25 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:50:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 439 transitions. [2024-11-08 17:50:40,757 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 439 transitions. Word has length 155 [2024-11-08 17:50:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 439 transitions. [2024-11-08 17:50:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.6) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 17:50:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 439 transitions. [2024-11-08 17:50:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:50:40,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:40,760 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:40,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:50:40,760 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1816762301, now seen corresponding path program 1 times [2024-11-08 17:50:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818944470] [2024-11-08 17:50:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:50:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:50:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:50:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:50:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:50:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:50:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:50:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:50:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:50:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:50:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:43,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818944470] [2024-11-08 17:50:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818944470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:50:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146302875] [2024-11-08 17:50:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:43,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:50:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:50:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:50:43,137 INFO L87 Difference]: Start difference. First operand 369 states and 439 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:44,956 INFO L93 Difference]: Finished difference Result 646 states and 769 transitions. [2024-11-08 17:50:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:50:44,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2024-11-08 17:50:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:44,960 INFO L225 Difference]: With dead ends: 646 [2024-11-08 17:50:44,961 INFO L226 Difference]: Without dead ends: 347 [2024-11-08 17:50:44,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:50:44,962 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 119 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:44,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 504 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:50:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-08 17:50:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-08 17:50:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.1672727272727272) internal successors, (321), 277 states have internal predecessors, (321), 46 states have call successors, (46), 25 states have call predecessors, (46), 25 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:50:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 413 transitions. [2024-11-08 17:50:45,060 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 413 transitions. Word has length 157 [2024-11-08 17:50:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:45,061 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 413 transitions. [2024-11-08 17:50:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 413 transitions. [2024-11-08 17:50:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:50:45,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:45,063 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:50:45,064 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:45,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1928498580, now seen corresponding path program 1 times [2024-11-08 17:50:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333732836] [2024-11-08 17:50:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:50:45,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:50:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:50:45,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:50:45,593 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:50:45,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:50:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:50:45,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:50:45,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:50:45,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:50:45 BoogieIcfgContainer [2024-11-08 17:50:45,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:50:45,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:50:45,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:50:45,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:50:45,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:43" (3/4) ... [2024-11-08 17:50:45,731 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:50:45,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:50:45,733 INFO L158 Benchmark]: Toolchain (without parser) took 124062.98ms. Allocated memory was 140.5MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 107.4MB in the beginning and 574.5MB in the end (delta: -467.2MB). Peak memory consumption was 407.9MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,733 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 140.5MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:50:45,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.19ms. Allocated memory is still 140.5MB. Free memory was 107.0MB in the beginning and 88.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.52ms. Allocated memory is still 140.5MB. Free memory was 88.5MB in the beginning and 83.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,734 INFO L158 Benchmark]: Boogie Preprocessor took 79.60ms. Allocated memory is still 140.5MB. Free memory was 83.9MB in the beginning and 80.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,734 INFO L158 Benchmark]: RCFGBuilder took 1313.37ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 80.1MB in the beginning and 148.6MB in the end (delta: -68.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,734 INFO L158 Benchmark]: TraceAbstraction took 121942.49ms. Allocated memory was 205.5MB in the beginning and 1.0GB in the end (delta: 807.4MB). Free memory was 148.6MB in the beginning and 574.5MB in the end (delta: -426.0MB). Peak memory consumption was 381.5MB. Max. memory is 16.1GB. [2024-11-08 17:50:45,734 INFO L158 Benchmark]: Witness Printer took 8.36ms. Allocated memory is still 1.0GB. Free memory is still 574.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:50:45,735 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.45ms. Allocated memory is still 140.5MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.19ms. Allocated memory is still 140.5MB. Free memory was 107.0MB in the beginning and 88.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.52ms. Allocated memory is still 140.5MB. Free memory was 88.5MB in the beginning and 83.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.60ms. Allocated memory is still 140.5MB. Free memory was 83.9MB in the beginning and 80.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1313.37ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 80.1MB in the beginning and 148.6MB in the end (delta: -68.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 121942.49ms. Allocated memory was 205.5MB in the beginning and 1.0GB in the end (delta: 807.4MB). Free memory was 148.6MB in the beginning and 574.5MB in the end (delta: -426.0MB). Peak memory consumption was 381.5MB. Max. memory is 16.1GB. * Witness Printer took 8.36ms. Allocated memory is still 1.0GB. Free memory is still 574.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 119. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 5, 1456677701, 1000000000, 1, 0, 0, 0, 256.5, 8.8, 1, 16, 3110219175, 128, 1, 0 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L127] RET updateVariables() [L128] CALL step() [L60] EXPR WrapperStruct00.var_1_7 [L60] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_7 [L61] EXPR WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_13 [L61] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND TRUE WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4) [L62] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L62] EXPR WrapperStruct00.var_1_14 [L62] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] COND TRUE (WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 [L65] WrapperStruct00.var_1_15 = (! WrapperStruct00.var_1_11) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_3 [L69] EXPR WrapperStruct00.var_1_4 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))) [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) VAL [WrapperStruct00={4:0}, isInitial=1] [L70] signed long int stepLocal_1 = (((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)); [L71] EXPR WrapperStruct00.var_1_3 [L71] unsigned long int stepLocal_0 = WrapperStruct00.var_1_3; [L72] EXPR WrapperStruct00.var_1_4 [L72] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-3221225473, stepLocal_1=65534] [L72] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L72] EXPR WrapperStruct00.var_1_4 [L72] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-3221225473, stepLocal_1=65534] [L72] COND TRUE stepLocal_1 != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-3221225473] [L73] COND FALSE !(WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7)) [L119] EXPR WrapperStruct00.var_1_6 [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1) [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L119] EXPR WrapperStruct00.var_1_14 [L119] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119-L120] return ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 121.7s, OverallIterations: 25, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5081 SdHoareTripleChecker+Valid, 33.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5035 mSDsluCounter, 16170 SdHoareTripleChecker+Invalid, 30.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13250 mSDsCounter, 908 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16656 IncrementalHoareTripleChecker+Invalid, 17564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 908 mSolverCounterUnsat, 2920 mSDtfsCounter, 16656 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2691 GetRequests, 2282 SyntacticMatches, 11 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3701 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=981occurred in iteration=21, InterpolantAutomatonStates: 340, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 1348 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 66.1s InterpolantComputationTime, 4304 NumberOfCodeBlocks, 4304 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4722 ConstructedInterpolants, 0 QuantifiedInterpolants, 36690 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2281 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 18618/19584 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 17:50:45,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:50:48,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:50:48,953 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:50:48,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:50:48,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:50:49,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:50:49,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:50:49,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:50:49,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:50:49,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:50:49,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:50:49,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:50:49,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:50:49,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:50:49,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:50:49,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:50:49,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:50:49,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:50:49,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:50:49,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:50:49,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:50:49,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:50:49,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:50:49,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:50:49,037 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:50:49,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:50:49,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:50:49,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:50:49,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:50:49,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:50:49,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:50:49,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:50:49,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:50:49,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:50:49,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:50:49,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:50:49,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:50:49,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:50:49,049 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:50:49,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:50:49,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:50:49,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:50:49,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:50:49,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:50:49,051 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2024-11-08 17:50:49,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:50:49,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:50:49,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:50:49,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:50:49,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:50:49,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i Unable to find full path for "g++" [2024-11-08 17:50:52,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:50:52,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:50:52,696 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2024-11-08 17:50:52,710 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/39ef64345/9a104894bfd042858c6ec254519c9581/FLAGa4b170ae9 [2024-11-08 17:50:52,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/data/39ef64345/9a104894bfd042858c6ec254519c9581 [2024-11-08 17:50:52,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:50:52,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:50:52,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:50:52,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:50:52,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:50:52,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:50:52" (1/1) ... [2024-11-08 17:50:52,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7608c318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:52, skipping insertion in model container [2024-11-08 17:50:52,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:50:52" (1/1) ... [2024-11-08 17:50:52,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:50:53,098 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2024-11-08 17:50:53,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:50:53,302 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:50:53,321 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_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2024-11-08 17:50:53,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:50:53,454 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:50:53,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53 WrapperNode [2024-11-08 17:50:53,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:50:53,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:50:53,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:50:53,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:50:53,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,576 INFO L138 Inliner]: procedures = 37, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2024-11-08 17:50:53,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:50:53,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:50:53,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:50:53,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:50:53,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,662 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-08 17:50:53,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:50:53,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:50:53,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:50:53,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:50:53,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (1/1) ... [2024-11-08 17:50:53,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:50:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:50:53,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:50:53,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:50:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:50:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:50:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:50:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 17:50:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 17:50:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:50:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:50:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:50:53,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:50:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 17:50:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 17:50:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 17:50:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 17:50:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 17:50:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 17:50:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:50:53,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:50:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:50:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:50:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:50:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:50:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:50:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:50:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:50:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:50:54,145 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:50:54,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:50:55,726 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 17:50:55,726 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:50:55,744 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:50:55,745 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:50:55,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:50:55 BoogieIcfgContainer [2024-11-08 17:50:55,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:50:55,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:50:55,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:50:55,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:50:55,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:50:52" (1/3) ... [2024-11-08 17:50:55,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:50:55, skipping insertion in model container [2024-11-08 17:50:55,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:50:53" (2/3) ... [2024-11-08 17:50:55,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:50:55, skipping insertion in model container [2024-11-08 17:50:55,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:50:55" (3/3) ... [2024-11-08 17:50:55,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2024-11-08 17:50:55,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:50:55,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:50:55,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:50:55,875 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;@2173cf04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:50:55,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:50:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:50:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:50:55,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:55,900 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:55,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1912926115, now seen corresponding path program 1 times [2024-11-08 17:50:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:50:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716777706] [2024-11-08 17:50:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:55,929 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:50:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:50:55,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:55,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:56,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:50:56,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-08 17:50:56,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:50:56,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:50:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716777706] [2024-11-08 17:50:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716777706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:56,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:56,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:50:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362688400] [2024-11-08 17:50:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:56,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:50:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:50:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:50:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:50:56,644 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:56,702 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-08 17:50:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:50:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 17:50:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:56,719 INFO L225 Difference]: With dead ends: 217 [2024-11-08 17:50:56,720 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:50:56,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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 17:50:56,747 INFO L432 NwaCegarLoop]: 155 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, 155 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 17:50:56,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:50:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:50:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 17:50:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:50:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-08 17:50:56,836 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-08 17:50:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-08 17:50:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-08 17:50:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:50:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:56,851 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:50:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:57,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:57,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1070900733, now seen corresponding path program 1 times [2024-11-08 17:50:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:50:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250341697] [2024-11-08 17:50:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:57,059 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:50:57,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:50:57,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:57,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:57,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:50:57,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-08 17:50:57,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:50:57,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:50:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250341697] [2024-11-08 17:50:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250341697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:50:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842040874] [2024-11-08 17:50:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:57,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:50:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:50:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:50:57,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:50:57,825 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:57,951 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-08 17:50:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:50:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 17:50:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:57,955 INFO L225 Difference]: With dead ends: 215 [2024-11-08 17:50:57,955 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 17:50:57,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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 17:50:57,962 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 17:50:57,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:50:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 17:50:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 17:50:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:50:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-11-08 17:50:58,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 140 [2024-11-08 17:50:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:58,009 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-11-08 17:50:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:50:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-11-08 17:50:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:50:58,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:58,019 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:58,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:58,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:58,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1909934395, now seen corresponding path program 1 times [2024-11-08 17:50:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:50:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10207150] [2024-11-08 17:50:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:58,223 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:50:58,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:50:58,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:58,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:50:58,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:58,777 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 21 treesize of output 9 [2024-11-08 17:50:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:50:58,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:50:58,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:50:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10207150] [2024-11-08 17:50:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10207150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:58,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:58,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:50:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467598276] [2024-11-08 17:50:58,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:50:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:50:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:50:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:50:58,841 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:50:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:58,909 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2024-11-08 17:50:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:50:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-08 17:50:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:58,916 INFO L225 Difference]: With dead ends: 217 [2024-11-08 17:50:58,916 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 17:50:58,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:50:58,919 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:58,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:50:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 17:50:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 17:50:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:50:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-08 17:50:58,947 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 140 [2024-11-08 17:50:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:58,949 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-08 17:50:58,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:50:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-08 17:50:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:50:58,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:58,956 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:59,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:59,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:59,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1363964547, now seen corresponding path program 1 times [2024-11-08 17:50:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:50:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304416218] [2024-11-08 17:50:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:50:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:50:59,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:50:59,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:50:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:59,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:50:59,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:50:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:50:59,918 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 32 treesize of output 35 [2024-11-08 17:51:03,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:03,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 41 [2024-11-08 17:51:04,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:04,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-08 17:51:04,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:04,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-08 17:51:05,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:05,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-11-08 17:51:05,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:05,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2024-11-08 17:51:06,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 78 [2024-11-08 17:51:06,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:06,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 81 [2024-11-08 17:51:06,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:06,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 126 [2024-11-08 17:51:07,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:07,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 132 treesize of output 140 [2024-11-08 17:51:08,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:08,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 168 treesize of output 68 [2024-11-08 17:51:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 439 proven. 30 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-08 17:51:08,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:51:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:51:08,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304416218] [2024-11-08 17:51:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304416218] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:51:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 15 [2024-11-08 17:51:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456913585] [2024-11-08 17:51:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:51:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:51:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:51:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-08 17:51:08,659 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:51:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:10,701 INFO L93 Difference]: Finished difference Result 223 states and 315 transitions. [2024-11-08 17:51:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:51:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-08 17:51:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:10,704 INFO L225 Difference]: With dead ends: 223 [2024-11-08 17:51:10,705 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 17:51:10,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2024-11-08 17:51:10,707 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 85 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:10,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 339 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:51:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 17:51:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-08 17:51:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:51:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-08 17:51:10,726 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 140 [2024-11-08 17:51:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:10,727 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-08 17:51:10,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:51:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-08 17:51:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:51:10,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:10,731 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:51:10,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:51:10,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2065029125, now seen corresponding path program 1 times [2024-11-08 17:51:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:51:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658176968] [2024-11-08 17:51:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:10,935 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:51:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:51:10,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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:51:10,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 17:51:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 17:51:11,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:11,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:51:11,792 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 38 treesize of output 16 [2024-11-08 17:51:11,928 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 33 treesize of output 26 [2024-11-08 17:51:12,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:12,216 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 39 [2024-11-08 17:51:16,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:16,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2024-11-08 17:51:24,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:24,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:51:25,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:25,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:51:25,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:25,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:51:26,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:26,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:51:26,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:26,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 66 [2024-11-08 17:51:26,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:26,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 70 [2024-11-08 17:51:26,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:26,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 106 [2024-11-08 17:51:27,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 42 [2024-11-08 17:51:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 370 proven. 84 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-11-08 17:51:27,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:51:28,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658176968] [2024-11-08 17:51:28,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658176968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944299446] [2024-11-08 17:51:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:28,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:51:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:51:28,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:51:28,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:51:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:28,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 17:51:28,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:28,836 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 38 treesize of output 16 [2024-11-08 17:51:28,981 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 33 treesize of output 26 [2024-11-08 17:51:29,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:29,253 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 39 [2024-11-08 17:51:33,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:33,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2024-11-08 17:52:05,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:05,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:52:06,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:06,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-08 17:52:06,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:06,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2024-11-08 17:52:11,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 68 [2024-11-08 17:52:11,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:11,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 79 [2024-11-08 17:52:20,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:20,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 83 [2024-11-08 17:52:20,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:20,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 117 treesize of output 119 [2024-11-08 17:53:05,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:05,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 122 treesize of output 46 [2024-11-08 17:53:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 450 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 17:53:05,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944299446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:06,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:53:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 24 [2024-11-08 17:53:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600426370] [2024-11-08 17:53:06,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:06,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:53:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:53:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:53:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=577, Unknown=25, NotChecked=0, Total=756 [2024-11-08 17:53:06,707 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 23 states have internal predecessors, (98), 9 states have call successors, (27), 8 states have call predecessors, (27), 9 states have return successors, (27), 8 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-08 17:53:29,447 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:53:33,461 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:53:37,571 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:53:41,595 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:53:45,609 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:53:49,622 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:54:05,737 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:54:09,748 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:54:13,765 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:54:29,889 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:54:33,905 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:54:37,922 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:54:41,928 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:54:45,936 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:54:49,941 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:54:53,968 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:54:57,980 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:55:01,990 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:55:06,022 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:55:10,033 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:55:14,054 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:55:18,072 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:55:22,083 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:55:26,094 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:55:30,100 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:55:34,104 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:55:38,111 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:55:54,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:55:58,204 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:56:02,213 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:56:06,242 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:56:10,255 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:56:14,263 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:56:18,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:56:22,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:56:26,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:56:30,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:56:34,409 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:56:38,413 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:56:42,421 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:56:46,430 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:56:50,435 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:56:54,440 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:56:58,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:57:02,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:57:06,547 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:57:10,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:57:14,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:57:18,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:57:22,392 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:57:26,396 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:57:30,407 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:57:34,410 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:57:54,513 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:57:58,525 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:58:02,549 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:58:06,562 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:58:26,677 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:58:30,684 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:58:34,717 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:58:38,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:00:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:00:56,873 INFO L93 Difference]: Finished difference Result 264 states and 349 transitions. [2024-11-08 18:00:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 18:00:56,875 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 23 states have internal predecessors, (98), 9 states have call successors, (27), 8 states have call predecessors, (27), 9 states have return successors, (27), 8 states have call predecessors, (27), 9 states have call successors, (27) Word has length 140 [2024-11-08 18:00:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:00:56,878 INFO L225 Difference]: With dead ends: 264 [2024-11-08 18:00:56,878 INFO L226 Difference]: Without dead ends: 151 [2024-11-08 18:00:56,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 300 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 320.0s TimeCoverageRelationStatistics Valid=525, Invalid=2154, Unknown=77, NotChecked=0, Total=2756 [2024-11-08 18:00:56,881 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 249 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 45 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 257.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 258.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:00:56,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 581 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1119 Invalid, 61 Unknown, 0 Unchecked, 258.1s Time] [2024-11-08 18:00:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-08 18:00:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2024-11-08 18:00:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:00:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 180 transitions. [2024-11-08 18:00:56,911 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 180 transitions. Word has length 140 [2024-11-08 18:00:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:00:56,912 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 180 transitions. [2024-11-08 18:00:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 23 states have internal predecessors, (98), 9 states have call successors, (27), 8 states have call predecessors, (27), 9 states have return successors, (27), 8 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-08 18:00:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2024-11-08 18:00:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 18:00:56,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:00:56,915 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:00:56,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:00:57,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 18:00:57,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:00:57,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:00:57,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:00:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1053911875, now seen corresponding path program 1 times [2024-11-08 18:00:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:00:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617603457] [2024-11-08 18:00:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:00:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:00:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:00:57,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:00:57,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/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 18:00:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:00:57,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:00:57,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:00:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 18:00:58,161 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 38 treesize of output 16 [2024-11-08 18:00:58,280 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 38 treesize of output 16 [2024-11-08 18:00:58,404 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 38 treesize of output 16 [2024-11-08 18:00:58,542 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 49 treesize of output 16 [2024-11-08 18:00:58,640 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 49 treesize of output 16 [2024-11-08 18:00:58,735 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 38 treesize of output 16 [2024-11-08 18:00:58,859 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 38 treesize of output 16 [2024-11-08 18:00:59,018 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 33 treesize of output 26 [2024-11-08 18:00:59,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:59,302 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-11-08 18:00:59,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2024-11-08 18:00:59,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:59,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 65 [2024-11-08 18:00:59,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:59,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 101 [2024-11-08 18:01:00,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:01:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 37 [2024-11-08 18:01:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 244 proven. 96 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 18:01:00,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:01:01,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:01:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617603457] [2024-11-08 18:01:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617603457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:01:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977578409] [2024-11-08 18:01:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:01:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:01:01,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:01:01,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9f6836-a3c3-4d2d-8c36-f9ffd4e1b67d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:01:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:01,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 18:01:01,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:01:01,738 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 38 treesize of output 16 [2024-11-08 18:01:01,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 38 treesize of output 16 [2024-11-08 18:01:01,973 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 38 treesize of output 16 [2024-11-08 18:01:02,105 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 44 treesize of output 26 [2024-11-08 18:01:30,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:01:30,421 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 39 [2024-11-08 18:02:02,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:02:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2024-11-08 18:02:03,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:02:03,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2024-11-08 18:02:03,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:02:03,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2024-11-08 18:02:27,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:02:27,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65