./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:13:11,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:13:11,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:13:11,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:13:11,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:13:11,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:13:11,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:13:11,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:13:11,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:13:11,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:13:11,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:13:11,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:13:11,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:13:11,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:13:11,626 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:13:11,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:13:11,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:13:11,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:13:11,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:13:11,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:13:11,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:13:11,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:13:11,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:13:11,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:13:11,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:13:11,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:13:11,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:13:11,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:13:11,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:13:11,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:13:11,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:13:11,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:13:11,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:11,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:13:11,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:13:11,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:13:11,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:13:11,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:13:11,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:13:11,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:13:11,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:13:11,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:13:11,634 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-10-24 11:13:11,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:13:11,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:13:11,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:13:11,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:13:11,898 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:13:11,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:13,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:13:13,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:13:13,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:13,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b818191e6/cac8b081fec0408c9215e79af11b24db/FLAGd66d383e5 [2024-10-24 11:13:13,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b818191e6/cac8b081fec0408c9215e79af11b24db [2024-10-24 11:13:13,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:13:13,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:13:13,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:13,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:13:13,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:13:13,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:13" (1/1) ... [2024-10-24 11:13:13,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f771b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:13, skipping insertion in model container [2024-10-24 11:13:13,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:13" (1/1) ... [2024-10-24 11:13:13,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:13:13,938 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-10-24 11:13:13,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:14,000 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:13:14,011 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-10-24 11:13:14,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:14,076 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:13:14,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14 WrapperNode [2024-10-24 11:13:14,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:14,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:14,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:13:14,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:13:14,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,165 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2024-10-24 11:13:14,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:14,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:13:14,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:13:14,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:13:14,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,251 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-10-24 11:13:14,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:13:14,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:13:14,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:13:14,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:13:14,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (1/1) ... [2024-10-24 11:13:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:13:14,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:13:14,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:13:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:13:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:13:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:13:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:13:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:13:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:13:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:13:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:13:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:13:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:13:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:13:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:13:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:13:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:13:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:13:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:13:14,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:13:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:13:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:13:14,494 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:13:14,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:13:15,004 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-10-24 11:13:15,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:13:15,026 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:13:15,028 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:13:15,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:15 BoogieIcfgContainer [2024-10-24 11:13:15,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:13:15,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:13:15,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:13:15,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:13:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:13:13" (1/3) ... [2024-10-24 11:13:15,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4e8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:15, skipping insertion in model container [2024-10-24 11:13:15,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:14" (2/3) ... [2024-10-24 11:13:15,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4e8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:15, skipping insertion in model container [2024-10-24 11:13:15,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:15" (3/3) ... [2024-10-24 11:13:15,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:15,050 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:13:15,050 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:13:15,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:13:15,107 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;@4cc541de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:13:15,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:13:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:15,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:15,130 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:15,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -827617158, now seen corresponding path program 1 times [2024-10-24 11:13:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:15,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656331398] [2024-10-24 11:13:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656331398] [2024-10-24 11:13:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656331398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:13:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281267701] [2024-10-24 11:13:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:13:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:13:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:13:15,594 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:15,636 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2024-10-24 11:13:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:13:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:13:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:15,645 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:13:15,646 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:13:15,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-10-24 11:13:15,653 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:15,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:13:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 11:13:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2024-10-24 11:13:15,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2024-10-24 11:13:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2024-10-24 11:13:15,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2024-10-24 11:13:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:15,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:15,743 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:15,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:13:15,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -188368040, now seen corresponding path program 1 times [2024-10-24 11:13:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164759451] [2024-10-24 11:13:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164759451] [2024-10-24 11:13:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164759451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564720108] [2024-10-24 11:13:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:16,067 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:16,106 INFO L93 Difference]: Finished difference Result 239 states and 358 transitions. [2024-10-24 11:13:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:13:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:16,108 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:13:16,109 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:13:16,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:13:16,110 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:16,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:13:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:13:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-10-24 11:13:16,121 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 163 [2024-10-24 11:13:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-10-24 11:13:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-10-24 11:13:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:16,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:16,127 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:13:16,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash 954134426, now seen corresponding path program 1 times [2024-10-24 11:13:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875562751] [2024-10-24 11:13:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:16,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875562751] [2024-10-24 11:13:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875562751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359533909] [2024-10-24 11:13:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:16,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:16,409 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:16,465 INFO L93 Difference]: Finished difference Result 244 states and 364 transitions. [2024-10-24 11:13:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:16,468 INFO L225 Difference]: With dead ends: 244 [2024-10-24 11:13:16,468 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:13:16,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:13:16,473 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:16,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:13:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-24 11:13:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-10-24 11:13:16,488 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 163 [2024-10-24 11:13:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-10-24 11:13:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-10-24 11:13:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:16,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:16,498 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:16,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:13:16,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:16,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1651889128, now seen corresponding path program 1 times [2024-10-24 11:13:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090201779] [2024-10-24 11:13:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:16,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090201779] [2024-10-24 11:13:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090201779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735927652] [2024-10-24 11:13:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:16,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:16,882 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:17,070 INFO L93 Difference]: Finished difference Result 371 states and 548 transitions. [2024-10-24 11:13:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:17,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:17,073 INFO L225 Difference]: With dead ends: 371 [2024-10-24 11:13:17,073 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 11:13:17,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:17,075 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 175 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:17,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 480 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 11:13:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 221. [2024-10-24 11:13:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.375) internal successors, (242), 176 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 326 transitions. [2024-10-24 11:13:17,089 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 326 transitions. Word has length 163 [2024-10-24 11:13:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:17,089 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 326 transitions. [2024-10-24 11:13:17,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 326 transitions. [2024-10-24 11:13:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:17,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:17,091 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:17,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:13:17,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:17,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 837639834, now seen corresponding path program 1 times [2024-10-24 11:13:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275101499] [2024-10-24 11:13:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275101499] [2024-10-24 11:13:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275101499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93444835] [2024-10-24 11:13:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:17,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:17,709 INFO L87 Difference]: Start difference. First operand 221 states and 326 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:17,874 INFO L93 Difference]: Finished difference Result 354 states and 523 transitions. [2024-10-24 11:13:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:13:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:17,876 INFO L225 Difference]: With dead ends: 354 [2024-10-24 11:13:17,877 INFO L226 Difference]: Without dead ends: 225 [2024-10-24 11:13:17,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:17,878 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 174 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:17,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 405 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-24 11:13:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-24 11:13:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2024-10-24 11:13:17,890 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 163 [2024-10-24 11:13:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:17,890 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2024-10-24 11:13:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2024-10-24 11:13:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:17,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:17,893 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:17,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:13:17,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:17,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445848, now seen corresponding path program 1 times [2024-10-24 11:13:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104257719] [2024-10-24 11:13:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104257719] [2024-10-24 11:13:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104257719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074334293] [2024-10-24 11:13:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:18,186 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:18,321 INFO L93 Difference]: Finished difference Result 459 states and 676 transitions. [2024-10-24 11:13:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:18,324 INFO L225 Difference]: With dead ends: 459 [2024-10-24 11:13:18,325 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 11:13:18,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:18,327 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 140 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 990 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 11:13:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2024-10-24 11:13:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 342 transitions. [2024-10-24 11:13:18,351 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 342 transitions. Word has length 163 [2024-10-24 11:13:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:18,352 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 342 transitions. [2024-10-24 11:13:18,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2024-10-24 11:13:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:18,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:18,353 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:18,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:13:18,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:18,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash -173477416, now seen corresponding path program 1 times [2024-10-24 11:13:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431307204] [2024-10-24 11:13:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431307204] [2024-10-24 11:13:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431307204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:13:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996138595] [2024-10-24 11:13:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:13:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:13:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:18,857 INFO L87 Difference]: Start difference. First operand 233 states and 342 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:19,114 INFO L93 Difference]: Finished difference Result 493 states and 724 transitions. [2024-10-24 11:13:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:19,116 INFO L225 Difference]: With dead ends: 493 [2024-10-24 11:13:19,116 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 11:13:19,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:13:19,117 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 530 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:19,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 475 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:13:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 11:13:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 229. [2024-10-24 11:13:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3478260869565217) internal successors, (248), 184 states have internal predecessors, (248), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2024-10-24 11:13:19,146 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 163 [2024-10-24 11:13:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2024-10-24 11:13:19,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2024-10-24 11:13:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 11:13:19,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:19,148 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:13:19,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1171585729, now seen corresponding path program 1 times [2024-10-24 11:13:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704572035] [2024-10-24 11:13:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:13:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704572035] [2024-10-24 11:13:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704572035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:13:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324812824] [2024-10-24 11:13:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:19,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:13:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:13:19,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:13:19,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:13:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:20,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 11:13:20,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:20,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:13:20,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2024-10-24 11:13:20,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:13:20,710 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 52 treesize of output 29 [2024-10-24 11:13:20,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:13:20,938 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 149 treesize of output 86 [2024-10-24 11:13:21,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-24 11:13:21,137 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 38 treesize of output 26 [2024-10-24 11:13:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 90 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-10-24 11:13:21,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:13:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324812824] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:13:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:13:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 25] total 34 [2024-10-24 11:13:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775914984] [2024-10-24 11:13:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:13:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:13:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 11:13:22,124 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:22,552 INFO L93 Difference]: Finished difference Result 473 states and 683 transitions. [2024-10-24 11:13:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:13:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-10-24 11:13:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:22,555 INFO L225 Difference]: With dead ends: 473 [2024-10-24 11:13:22,555 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 11:13:22,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 11:13:22,556 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 479 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:22,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1260 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:13:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 11:13:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2024-10-24 11:13:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 283 states have (on average 1.3604240282685511) internal successors, (385), 284 states have internal predecessors, (385), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2024-10-24 11:13:22,576 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 165 [2024-10-24 11:13:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:22,577 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2024-10-24 11:13:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2024-10-24 11:13:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 11:13:22,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:22,578 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:22,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:13:22,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:13:22,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:22,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash -978171750, now seen corresponding path program 1 times [2024-10-24 11:13:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279295856] [2024-10-24 11:13:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:22,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279295856] [2024-10-24 11:13:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279295856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:24,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:24,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:13:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570160733] [2024-10-24 11:13:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:24,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:13:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:13:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:13:24,127 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:24,320 INFO L93 Difference]: Finished difference Result 753 states and 1077 transitions. [2024-10-24 11:13:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:13:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-10-24 11:13:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:24,325 INFO L225 Difference]: With dead ends: 753 [2024-10-24 11:13:24,325 INFO L226 Difference]: Without dead ends: 516 [2024-10-24 11:13:24,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:13:24,326 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 84 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:24,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1235 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-24 11:13:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 402. [2024-10-24 11:13:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 342 states have (on average 1.3538011695906433) internal successors, (463), 343 states have internal predecessors, (463), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 573 transitions. [2024-10-24 11:13:24,350 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 573 transitions. Word has length 170 [2024-10-24 11:13:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:24,352 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 573 transitions. [2024-10-24 11:13:24,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 573 transitions. [2024-10-24 11:13:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 11:13:24,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:24,357 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:13:24,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:24,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash -660643686, now seen corresponding path program 1 times [2024-10-24 11:13:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005569482] [2024-10-24 11:13:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:25,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005569482] [2024-10-24 11:13:25,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005569482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:25,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:13:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217465480] [2024-10-24 11:13:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:25,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:13:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:13:25,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:13:25,385 INFO L87 Difference]: Start difference. First operand 402 states and 573 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:25,587 INFO L93 Difference]: Finished difference Result 882 states and 1242 transitions. [2024-10-24 11:13:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:13:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-10-24 11:13:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:25,592 INFO L225 Difference]: With dead ends: 882 [2024-10-24 11:13:25,592 INFO L226 Difference]: Without dead ends: 598 [2024-10-24 11:13:25,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:13:25,593 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 85 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:25,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1311 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-24 11:13:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 405. [2024-10-24 11:13:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 345 states have (on average 1.3594202898550725) internal successors, (469), 346 states have internal predecessors, (469), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 579 transitions. [2024-10-24 11:13:25,615 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 579 transitions. Word has length 170 [2024-10-24 11:13:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:25,616 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 579 transitions. [2024-10-24 11:13:25,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 579 transitions. [2024-10-24 11:13:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:25,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:25,617 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:25,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:13:25,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:25,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1136655836, now seen corresponding path program 1 times [2024-10-24 11:13:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382679986] [2024-10-24 11:13:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382679986] [2024-10-24 11:13:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382679986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718575196] [2024-10-24 11:13:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:25,878 INFO L87 Difference]: Start difference. First operand 405 states and 579 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:25,984 INFO L93 Difference]: Finished difference Result 948 states and 1356 transitions. [2024-10-24 11:13:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:25,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:13:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:25,987 INFO L225 Difference]: With dead ends: 948 [2024-10-24 11:13:25,987 INFO L226 Difference]: Without dead ends: 648 [2024-10-24 11:13:25,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:25,988 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 166 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:25,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 716 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-24 11:13:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 414. [2024-10-24 11:13:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 354 states have (on average 1.3333333333333333) internal successors, (472), 355 states have internal predecessors, (472), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 582 transitions. [2024-10-24 11:13:26,012 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 582 transitions. Word has length 172 [2024-10-24 11:13:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:26,012 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 582 transitions. [2024-10-24 11:13:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 582 transitions. [2024-10-24 11:13:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:26,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:26,015 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:13:26,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1454183900, now seen corresponding path program 1 times [2024-10-24 11:13:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169899184] [2024-10-24 11:13:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169899184] [2024-10-24 11:13:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169899184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:26,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055737140] [2024-10-24 11:13:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:26,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:26,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:26,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:26,276 INFO L87 Difference]: Start difference. First operand 414 states and 582 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:26,480 INFO L93 Difference]: Finished difference Result 942 states and 1326 transitions. [2024-10-24 11:13:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:13:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:13:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:26,483 INFO L225 Difference]: With dead ends: 942 [2024-10-24 11:13:26,483 INFO L226 Difference]: Without dead ends: 650 [2024-10-24 11:13:26,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:26,485 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 228 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:26,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 504 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:13:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-24 11:13:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 482. [2024-10-24 11:13:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 422 states have (on average 1.3175355450236967) internal successors, (556), 423 states have internal predecessors, (556), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 666 transitions. [2024-10-24 11:13:26,511 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 666 transitions. Word has length 172 [2024-10-24 11:13:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 666 transitions. [2024-10-24 11:13:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 666 transitions. [2024-10-24 11:13:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:26,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:26,514 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:26,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:13:26,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1061156890, now seen corresponding path program 1 times [2024-10-24 11:13:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290507604] [2024-10-24 11:13:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290507604] [2024-10-24 11:13:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290507604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260309155] [2024-10-24 11:13:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:26,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:26,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:26,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:26,635 INFO L87 Difference]: Start difference. First operand 482 states and 666 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:26,674 INFO L93 Difference]: Finished difference Result 835 states and 1161 transitions. [2024-10-24 11:13:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:13:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:26,677 INFO L225 Difference]: With dead ends: 835 [2024-10-24 11:13:26,678 INFO L226 Difference]: Without dead ends: 494 [2024-10-24 11:13:26,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:13:26,679 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:26,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-24 11:13:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-10-24 11:13:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 428 states have (on average 1.3130841121495327) internal successors, (562), 429 states have internal predecessors, (562), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 672 transitions. [2024-10-24 11:13:26,704 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 672 transitions. Word has length 172 [2024-10-24 11:13:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:26,705 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 672 transitions. [2024-10-24 11:13:26,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 672 transitions. [2024-10-24 11:13:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:26,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:26,707 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:26,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:13:26,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -520712484, now seen corresponding path program 1 times [2024-10-24 11:13:26,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:26,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429412723] [2024-10-24 11:13:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:27,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429412723] [2024-10-24 11:13:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429412723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:13:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210900654] [2024-10-24 11:13:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:27,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:13:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:13:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:27,128 INFO L87 Difference]: Start difference. First operand 488 states and 672 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:27,297 INFO L93 Difference]: Finished difference Result 868 states and 1182 transitions. [2024-10-24 11:13:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:13:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:13:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:27,301 INFO L225 Difference]: With dead ends: 868 [2024-10-24 11:13:27,301 INFO L226 Difference]: Without dead ends: 866 [2024-10-24 11:13:27,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:13:27,302 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 115 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:27,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1046 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-24 11:13:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 704. [2024-10-24 11:13:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 644 states have (on average 1.3012422360248448) internal successors, (838), 645 states have internal predecessors, (838), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:13:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 948 transitions. [2024-10-24 11:13:27,347 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 948 transitions. Word has length 172 [2024-10-24 11:13:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:27,348 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 948 transitions. [2024-10-24 11:13:27,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 948 transitions. [2024-10-24 11:13:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:27,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:27,350 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:27,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:13:27,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1324663264, now seen corresponding path program 1 times [2024-10-24 11:13:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867163724] [2024-10-24 11:13:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867163724] [2024-10-24 11:13:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867163724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:13:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707764922] [2024-10-24 11:13:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:27,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:13:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:13:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:27,942 INFO L87 Difference]: Start difference. First operand 704 states and 948 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:28,062 INFO L93 Difference]: Finished difference Result 1293 states and 1740 transitions. [2024-10-24 11:13:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:13:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-24 11:13:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:28,065 INFO L225 Difference]: With dead ends: 1293 [2024-10-24 11:13:28,065 INFO L226 Difference]: Without dead ends: 788 [2024-10-24 11:13:28,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:28,068 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 92 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:28,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 601 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-24 11:13:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 784. [2024-10-24 11:13:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 713 states have (on average 1.2945301542777) internal successors, (923), 716 states have internal predecessors, (923), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 11:13:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1049 transitions. [2024-10-24 11:13:28,104 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1049 transitions. Word has length 172 [2024-10-24 11:13:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:28,104 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1049 transitions. [2024-10-24 11:13:28,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1049 transitions. [2024-10-24 11:13:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:28,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:28,106 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:28,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:13:28,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:28,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 931636254, now seen corresponding path program 1 times [2024-10-24 11:13:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32234861] [2024-10-24 11:13:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:28,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32234861] [2024-10-24 11:13:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32234861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:13:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065135614] [2024-10-24 11:13:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:28,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:13:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:28,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:13:28,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:13:28,590 INFO L87 Difference]: Start difference. First operand 784 states and 1049 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:28,773 INFO L93 Difference]: Finished difference Result 1588 states and 2123 transitions. [2024-10-24 11:13:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:13:28,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-24 11:13:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:28,777 INFO L225 Difference]: With dead ends: 1588 [2024-10-24 11:13:28,777 INFO L226 Difference]: Without dead ends: 1007 [2024-10-24 11:13:28,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:13:28,779 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 111 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:28,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 960 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-24 11:13:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1003. [2024-10-24 11:13:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 918 states have (on average 1.2864923747276689) internal successors, (1181), 923 states have internal predecessors, (1181), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-24 11:13:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1331 transitions. [2024-10-24 11:13:28,824 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1331 transitions. Word has length 172 [2024-10-24 11:13:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:28,824 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1331 transitions. [2024-10-24 11:13:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1331 transitions. [2024-10-24 11:13:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:28,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:28,826 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:13:28,826 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:28,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1189801692, now seen corresponding path program 1 times [2024-10-24 11:13:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385867058] [2024-10-24 11:13:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:29,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:29,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385867058] [2024-10-24 11:13:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385867058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934922877] [2024-10-24 11:13:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:29,069 INFO L87 Difference]: Start difference. First operand 1003 states and 1331 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:29,258 INFO L93 Difference]: Finished difference Result 1910 states and 2567 transitions. [2024-10-24 11:13:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:13:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:13:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:29,265 INFO L225 Difference]: With dead ends: 1910 [2024-10-24 11:13:29,265 INFO L226 Difference]: Without dead ends: 1146 [2024-10-24 11:13:29,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:29,266 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 140 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:29,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 763 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-10-24 11:13:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 976. [2024-10-24 11:13:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 891 states have (on average 1.281705948372615) internal successors, (1142), 896 states have internal predecessors, (1142), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-24 11:13:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1292 transitions. [2024-10-24 11:13:29,312 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1292 transitions. Word has length 172 [2024-10-24 11:13:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:29,312 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1292 transitions. [2024-10-24 11:13:29,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1292 transitions. [2024-10-24 11:13:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:29,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:29,314 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:13:29,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1901617376, now seen corresponding path program 1 times [2024-10-24 11:13:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332053516] [2024-10-24 11:13:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332053516] [2024-10-24 11:13:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332053516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:13:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084688934] [2024-10-24 11:13:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:29,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:13:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:29,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:13:29,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:29,783 INFO L87 Difference]: Start difference. First operand 976 states and 1292 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:29,927 INFO L93 Difference]: Finished difference Result 1725 states and 2283 transitions. [2024-10-24 11:13:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:29,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-24 11:13:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:29,931 INFO L225 Difference]: With dead ends: 1725 [2024-10-24 11:13:29,931 INFO L226 Difference]: Without dead ends: 988 [2024-10-24 11:13:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:29,934 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 88 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:29,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 775 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-24 11:13:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 926. [2024-10-24 11:13:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 849 states have (on average 1.2732626619552414) internal successors, (1081), 852 states have internal predecessors, (1081), 67 states have call successors, (67), 9 states have call predecessors, (67), 9 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:13:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1215 transitions. [2024-10-24 11:13:29,974 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1215 transitions. Word has length 172 [2024-10-24 11:13:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:29,974 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1215 transitions. [2024-10-24 11:13:29,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1215 transitions. [2024-10-24 11:13:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:13:29,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:29,976 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:13:29,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1963656990, now seen corresponding path program 1 times [2024-10-24 11:13:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778124907] [2024-10-24 11:13:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778124907] [2024-10-24 11:13:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778124907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:13:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626810417] [2024-10-24 11:13:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:13:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:13:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:13:30,518 INFO L87 Difference]: Start difference. First operand 926 states and 1215 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:30,715 INFO L93 Difference]: Finished difference Result 1696 states and 2227 transitions. [2024-10-24 11:13:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:13:30,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-24 11:13:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:30,718 INFO L225 Difference]: With dead ends: 1696 [2024-10-24 11:13:30,719 INFO L226 Difference]: Without dead ends: 1009 [2024-10-24 11:13:30,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:13:30,720 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 142 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:30,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1064 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-24 11:13:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1005. [2024-10-24 11:13:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 913 states have (on average 1.2683461117196058) internal successors, (1158), 918 states have internal predecessors, (1158), 79 states have call successors, (79), 12 states have call predecessors, (79), 12 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:13:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1316 transitions. [2024-10-24 11:13:30,766 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1316 transitions. Word has length 172 [2024-10-24 11:13:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1316 transitions. [2024-10-24 11:13:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1316 transitions. [2024-10-24 11:13:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:13:30,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:30,768 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:13:30,768 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1066216828, now seen corresponding path program 1 times [2024-10-24 11:13:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58935387] [2024-10-24 11:13:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:13:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:13:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:13:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:13:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:13:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:13:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:13:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:13:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:13:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:13:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:13:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:13:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:13:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 11:13:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:13:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:31,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58935387] [2024-10-24 11:13:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58935387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:13:31,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17678427] [2024-10-24 11:13:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:31,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:13:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:13:31,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:13:31,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:13:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:31,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:13:31,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:31,816 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 17 [2024-10-24 11:13:31,849 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 17 [2024-10-24 11:13:31,879 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 17 [2024-10-24 11:13:32,107 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 69 treesize of output 45 [2024-10-24 11:13:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:13:32,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:13:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:13:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17678427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:13:32,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:13:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12] total 19 [2024-10-24 11:13:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738442954] [2024-10-24 11:13:32,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:13:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 11:13:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 11:13:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:13:32,650 INFO L87 Difference]: Start difference. First operand 1005 states and 1316 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 1 states have call predecessors, (42), 3 states have call successors, (42) [2024-10-24 11:13:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:33,364 INFO L93 Difference]: Finished difference Result 2431 states and 3163 transitions. [2024-10-24 11:13:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 11:13:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 1 states have call predecessors, (42), 3 states have call successors, (42) Word has length 173 [2024-10-24 11:13:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:33,369 INFO L225 Difference]: With dead ends: 2431 [2024-10-24 11:13:33,370 INFO L226 Difference]: Without dead ends: 1653 [2024-10-24 11:13:33,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 373 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 11:13:33,372 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 746 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:33,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1364 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:13:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-24 11:13:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1197. [2024-10-24 11:13:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1056 states have (on average 1.25) internal successors, (1320), 1063 states have internal predecessors, (1320), 113 states have call successors, (113), 27 states have call predecessors, (113), 27 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-10-24 11:13:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1546 transitions. [2024-10-24 11:13:33,477 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1546 transitions. Word has length 173 [2024-10-24 11:13:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:33,477 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1546 transitions. [2024-10-24 11:13:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 1 states have call predecessors, (42), 3 states have call successors, (42) [2024-10-24 11:13:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1546 transitions. [2024-10-24 11:13:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:13:33,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:33,479 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:33,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:13:33,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-24 11:13:33,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:33,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -864425340, now seen corresponding path program 1 times [2024-10-24 11:13:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778629105] [2024-10-24 11:13:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:13:33,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:13:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:13:33,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:13:33,904 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:13:33,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:13:33,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:13:33,910 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] [2024-10-24 11:13:34,016 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:13:34,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:13:34 BoogieIcfgContainer [2024-10-24 11:13:34,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:13:34,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:13:34,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:13:34,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:13:34,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:15" (3/4) ... [2024-10-24 11:13:34,022 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:13:34,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:13:34,024 INFO L158 Benchmark]: Toolchain (without parser) took 20240.36ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 841.0MB). Free memory was 114.2MB in the beginning and 858.0MB in the end (delta: -743.8MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,024 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:13:34,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.29ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 96.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.84ms. Allocated memory is still 184.5MB. Free memory was 96.7MB in the beginning and 154.4MB in the end (delta: -57.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,025 INFO L158 Benchmark]: Boogie Preprocessor took 119.04ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 148.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,025 INFO L158 Benchmark]: RCFGBuilder took 740.66ms. Allocated memory is still 184.5MB. Free memory was 148.6MB in the beginning and 104.6MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,025 INFO L158 Benchmark]: TraceAbstraction took 18988.60ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 841.0MB). Free memory was 103.7MB in the beginning and 858.0MB in the end (delta: -754.4MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-10-24 11:13:34,026 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 1.0GB. Free memory is still 858.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:13:34,026 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.15ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.29ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 96.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.84ms. Allocated memory is still 184.5MB. Free memory was 96.7MB in the beginning and 154.4MB in the end (delta: -57.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.04ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 148.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 740.66ms. Allocated memory is still 184.5MB. Free memory was 148.6MB in the beginning and 104.6MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18988.60ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 841.0MB). Free memory was 103.7MB in the beginning and 858.0MB in the end (delta: -754.4MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 1.0GB. Free memory is still 858.0MB. 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 50, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_0_ = 0; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR BOOL_unsigned_char_Array_0[0] [L104] last_1_BOOL_unsigned_char_Array_0_0_ = BOOL_unsigned_char_Array_0[0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] float_Array_0[2] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_short_int_Array_0[0][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] RET updateVariables() [L116] CALL step() [L44] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_0_)) [L47] EXPR signed_short_int_Array_0[1][0] [L47] EXPR signed_short_int_Array_0[0][0] [L47] signed_short_int_Array_0[1][1] = ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]) [L49] EXPR float_Array_0[0] [L49] EXPR float_Array_0[1] [L49] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE (float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2] [L50] EXPR double_Array_0[0] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (double_Array_0[0] - 2.3) > float_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR signed_short_int_Array_0[1][0] [L51] unsigned_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]) [L58] EXPR signed_short_int_Array_0[1][1] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L58] EXPR BOOL_unsigned_char_Array_0[4] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L58] EXPR BOOL_unsigned_char_Array_0[3] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] = (! BOOL_unsigned_char_Array_0[1]) [L63] EXPR BOOL_unsigned_char_Array_0[0] [L63] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR signed_short_int_Array_0[1][0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L107] EXPR BOOL_unsigned_char_Array_0[4] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L107] EXPR BOOL_unsigned_char_Array_0[3] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[1] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) [L107] EXPR float_Array_0[0] [L107] EXPR float_Array_0[1] [L107] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107-L108] return ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3523 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3496 mSDsluCounter, 15645 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11807 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3150 IncrementalHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 3838 mSDtfsCounter, 3150 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1732 GetRequests, 1558 SyntacticMatches, 7 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=20, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1839 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 3878 NumberOfCodeBlocks, 3878 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4019 ConstructedInterpolants, 0 QuantifiedInterpolants, 16225 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 19830/20160 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-10-24 11:13:34,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:13:36,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:13:36,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:13:36,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:13:36,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:13:36,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:13:36,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:13:36,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:13:36,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:13:36,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:13:36,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:13:36,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:13:36,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:13:36,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:13:36,365 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:13:36,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:13:36,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:13:36,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:13:36,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:13:36,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:13:36,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:13:36,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:13:36,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:13:36,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:13:36,368 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:13:36,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:13:36,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:13:36,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:13:36,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:13:36,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:13:36,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:13:36,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:13:36,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:13:36,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:13:36,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:36,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:13:36,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:13:36,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:13:36,373 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:13:36,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:13:36,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:13:36,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:13:36,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:13:36,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:13:36,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:13:36,376 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-10-24 11:13:36,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:13:36,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:13:36,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:13:36,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:13:36,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:13:36,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:38,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:13:38,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:13:38,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:38,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9648056e7/ed562af95b0642d7a70dd868ef2504c4/FLAG0d99c291d [2024-10-24 11:13:38,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9648056e7/ed562af95b0642d7a70dd868ef2504c4 [2024-10-24 11:13:38,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:13:38,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:13:38,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:38,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:13:38,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:13:38,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c49686e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38, skipping insertion in model container [2024-10-24 11:13:38,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:13:38,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-10-24 11:13:38,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:38,722 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:13:38,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-10-24 11:13:38,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:38,825 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:13:38,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38 WrapperNode [2024-10-24 11:13:38,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:38,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:38,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:13:38,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:13:38,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,905 INFO L138 Inliner]: procedures = 39, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 566 [2024-10-24 11:13:38,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:38,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:13:38,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:13:38,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:13:38,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,959 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-10-24 11:13:38,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:38,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:39,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:39,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:39,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:39,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:13:39,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:13:39,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:13:39,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:13:39,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (1/1) ... [2024-10-24 11:13:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:13:39,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:13:39,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:13:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:13:39,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:13:39,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:13:39,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:13:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:13:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:13:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:13:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-24 11:13:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:13:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:13:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:13:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:13:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-24 11:13:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:13:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:13:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:13:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:13:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:13:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-24 11:13:39,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:13:39,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:13:44,936 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-24 11:13:44,936 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:13:44,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:13:44,983 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:13:44,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:44 BoogieIcfgContainer [2024-10-24 11:13:44,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:13:44,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:13:44,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:13:44,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:13:44,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:13:38" (1/3) ... [2024-10-24 11:13:44,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d52aaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:44, skipping insertion in model container [2024-10-24 11:13:44,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:38" (2/3) ... [2024-10-24 11:13:44,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d52aaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:44, skipping insertion in model container [2024-10-24 11:13:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:44" (3/3) ... [2024-10-24 11:13:44,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-10-24 11:13:45,005 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:13:45,007 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:13:45,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:13:45,053 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;@f33f95f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:13:45,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:13:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:45,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:45,077 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:45,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash -827617158, now seen corresponding path program 1 times [2024-10-24 11:13:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248050653] [2024-10-24 11:13:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:45,097 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-10-24 11:13:45,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:45,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:45,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:45,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:13:45,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-24 11:13:45,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:45,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:45,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248050653] [2024-10-24 11:13:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248050653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:45,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:45,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:13:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860071727] [2024-10-24 11:13:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:13:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:13:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:13:45,527 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:45,571 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2024-10-24 11:13:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:13:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:13:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:45,579 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:13:45,579 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:13:45,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-10-24 11:13:45,584 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:45,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:13:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 11:13:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2024-10-24 11:13:45,624 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2024-10-24 11:13:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:45,625 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2024-10-24 11:13:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2024-10-24 11:13:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:45,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:45,628 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:45,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:45,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -188368040, now seen corresponding path program 1 times [2024-10-24 11:13:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522334541] [2024-10-24 11:13:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:45,833 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-10-24 11:13:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:45,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:45,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:46,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:13:46,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-24 11:13:46,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:46,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522334541] [2024-10-24 11:13:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522334541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119684459] [2024-10-24 11:13:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:46,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:46,269 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:46,345 INFO L93 Difference]: Finished difference Result 239 states and 358 transitions. [2024-10-24 11:13:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:13:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:46,349 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:13:46,349 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:13:46,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 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-10-24 11:13:46,351 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:46,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:13:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:13:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:13:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-10-24 11:13:46,379 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 163 [2024-10-24 11:13:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-10-24 11:13:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-10-24 11:13:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:46,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:46,383 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:46,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:46,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:46,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 954134426, now seen corresponding path program 1 times [2024-10-24 11:13:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437437055] [2024-10-24 11:13:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:46,595 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-10-24 11:13:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:46,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:46,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:46,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:13:46,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:46,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:13:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:47,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:47,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437437055] [2024-10-24 11:13:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437437055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:13:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379869562] [2024-10-24 11:13:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:47,271 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:47,491 INFO L93 Difference]: Finished difference Result 377 states and 563 transitions. [2024-10-24 11:13:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:47,495 INFO L225 Difference]: With dead ends: 377 [2024-10-24 11:13:47,495 INFO L226 Difference]: Without dead ends: 257 [2024-10-24 11:13:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:47,497 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 196 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:47,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 498 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:13:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-24 11:13:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 215. [2024-10-24 11:13:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 320 transitions. [2024-10-24 11:13:47,532 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 320 transitions. Word has length 163 [2024-10-24 11:13:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 320 transitions. [2024-10-24 11:13:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 320 transitions. [2024-10-24 11:13:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:47,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:47,539 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:47,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-10-24 11:13:47,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:47,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash -851303908, now seen corresponding path program 1 times [2024-10-24 11:13:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606577779] [2024-10-24 11:13:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:13:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:47,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:47,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:48,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:13:48,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:48,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:48,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:48,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606577779] [2024-10-24 11:13:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606577779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306276602] [2024-10-24 11:13:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:48,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:48,074 INFO L87 Difference]: Start difference. First operand 215 states and 320 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:48,125 INFO L93 Difference]: Finished difference Result 365 states and 547 transitions. [2024-10-24 11:13:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:48,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:48,127 INFO L225 Difference]: With dead ends: 365 [2024-10-24 11:13:48,127 INFO L226 Difference]: Without dead ends: 221 [2024-10-24 11:13:48,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 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-10-24 11:13:48,128 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:48,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-24 11:13:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-24 11:13:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.375) internal successors, (242), 176 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 326 transitions. [2024-10-24 11:13:48,156 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 326 transitions. Word has length 163 [2024-10-24 11:13:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:48,157 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 326 transitions. [2024-10-24 11:13:48,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 326 transitions. [2024-10-24 11:13:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:48,161 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:48,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:48,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 837639834, now seen corresponding path program 1 times [2024-10-24 11:13:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742909226] [2024-10-24 11:13:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:48,363 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-10-24 11:13:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:48,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:48,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:48,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:13:48,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:48,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:48,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742909226] [2024-10-24 11:13:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742909226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602903353] [2024-10-24 11:13:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:48,813 INFO L87 Difference]: Start difference. First operand 221 states and 326 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:48,905 INFO L93 Difference]: Finished difference Result 373 states and 553 transitions. [2024-10-24 11:13:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:48,907 INFO L225 Difference]: With dead ends: 373 [2024-10-24 11:13:48,907 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 11:13:48,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:48,908 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:48,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:13:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 11:13:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-24 11:13:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2024-10-24 11:13:48,922 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 163 [2024-10-24 11:13:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:48,922 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2024-10-24 11:13:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2024-10-24 11:13:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:48,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:48,924 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:48,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:49,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:49,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:49,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445848, now seen corresponding path program 1 times [2024-10-24 11:13:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016478618] [2024-10-24 11:13:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:49,126 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-10-24 11:13:49,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:49,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:49,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:13:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:49,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:13:49,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:49,466 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 19 treesize of output 15 [2024-10-24 11:13:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:49,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:49,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016478618] [2024-10-24 11:13:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016478618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:49,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:49,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105337183] [2024-10-24 11:13:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:49,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:49,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:49,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:49,523 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:50,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:13:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:54,134 INFO L93 Difference]: Finished difference Result 487 states and 718 transitions. [2024-10-24 11:13:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:54,137 INFO L225 Difference]: With dead ends: 487 [2024-10-24 11:13:54,137 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 11:13:54,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:54,138 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 140 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:54,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 990 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 11:13:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 11:13:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2024-10-24 11:13:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 342 transitions. [2024-10-24 11:13:54,151 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 342 transitions. Word has length 163 [2024-10-24 11:13:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:54,153 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 342 transitions. [2024-10-24 11:13:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2024-10-24 11:13:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:13:54,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:54,156 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:54,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:13:54,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:54,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:54,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -173477416, now seen corresponding path program 1 times [2024-10-24 11:13:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346868032] [2024-10-24 11:13:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:54,358 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-10-24 11:13:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:54,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:54,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:54,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:13:54,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:13:54,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:54,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:54,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346868032] [2024-10-24 11:13:54,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346868032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23356388] [2024-10-24 11:13:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:13:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:13:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:13:54,741 INFO L87 Difference]: Start difference. First operand 233 states and 342 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:55,062 INFO L93 Difference]: Finished difference Result 531 states and 780 transitions. [2024-10-24 11:13:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:55,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:13:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:55,064 INFO L225 Difference]: With dead ends: 531 [2024-10-24 11:13:55,064 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 11:13:55,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:13:55,065 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 163 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:55,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 669 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:13:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 11:13:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 229. [2024-10-24 11:13:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3369565217391304) internal successors, (246), 184 states have internal predecessors, (246), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 330 transitions. [2024-10-24 11:13:55,091 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 330 transitions. Word has length 163 [2024-10-24 11:13:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:55,092 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 330 transitions. [2024-10-24 11:13:55,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:13:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 330 transitions. [2024-10-24 11:13:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 11:13:55,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:55,093 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:55,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:13:55,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:55,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1171585729, now seen corresponding path program 1 times [2024-10-24 11:13:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:13:55,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447098956] [2024-10-24 11:13:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:55,299 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-10-24 11:13:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:13:55,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:13:55,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:13:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:55,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:13:55,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:55,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:13:55,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-10-24 11:13:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-24 11:13:55,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:13:55,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:13:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447098956] [2024-10-24 11:13:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447098956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:55,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:13:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450603010] [2024-10-24 11:13:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:55,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:13:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:13:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:13:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:13:55,855 INFO L87 Difference]: Start difference. First operand 229 states and 330 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:59,942 INFO L93 Difference]: Finished difference Result 437 states and 628 transitions. [2024-10-24 11:13:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:13:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2024-10-24 11:13:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:59,955 INFO L225 Difference]: With dead ends: 437 [2024-10-24 11:13:59,955 INFO L226 Difference]: Without dead ends: 231 [2024-10-24 11:13:59,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:13:59,956 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 147 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:59,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 541 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-24 11:13:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-24 11:13:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-10-24 11:13:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.326086956521739) internal successors, (244), 184 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:13:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 328 transitions. [2024-10-24 11:13:59,975 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 328 transitions. Word has length 165 [2024-10-24 11:13:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:59,976 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 328 transitions. [2024-10-24 11:13:59,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:13:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 328 transitions. [2024-10-24 11:13:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 11:13:59,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:59,978 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:59,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:14:00,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:00,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:00,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1856187, now seen corresponding path program 1 times [2024-10-24 11:14:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055171814] [2024-10-24 11:14:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:00,180 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-10-24 11:14:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:00,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:00,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:14:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:00,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:14:00,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:14:00,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 37 treesize of output 30 [2024-10-24 11:14:01,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:01,133 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 47 treesize of output 43 [2024-10-24 11:14:01,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:01,467 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 46 [2024-10-24 11:14:03,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:03,553 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 98 treesize of output 74 [2024-10-24 11:14:03,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:03,703 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 74 treesize of output 38 [2024-10-24 11:14:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 178 proven. 114 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-24 11:14:03,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-24 11:14:04,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055171814] [2024-10-24 11:14:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055171814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:14:04,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:14:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2024-10-24 11:14:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727030092] [2024-10-24 11:14:04,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:14:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 11:14:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 11:14:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:14:04,505 INFO L87 Difference]: Start difference. First operand 229 states and 328 transitions. Second operand has 19 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) [2024-10-24 11:14:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:07,026 INFO L93 Difference]: Finished difference Result 585 states and 807 transitions. [2024-10-24 11:14:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-24 11:14:07,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) Word has length 167 [2024-10-24 11:14:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:07,029 INFO L225 Difference]: With dead ends: 585 [2024-10-24 11:14:07,030 INFO L226 Difference]: Without dead ends: 427 [2024-10-24 11:14:07,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=459, Invalid=1611, Unknown=0, NotChecked=0, Total=2070 [2024-10-24 11:14:07,032 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1171 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:07,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 865 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:14:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-24 11:14:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 257. [2024-10-24 11:14:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 206 states have (on average 1.2912621359223302) internal successors, (266), 206 states have internal predecessors, (266), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:14:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2024-10-24 11:14:07,059 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 167 [2024-10-24 11:14:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:07,060 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2024-10-24 11:14:07,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) [2024-10-24 11:14:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2024-10-24 11:14:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 11:14:07,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:07,062 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:07,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:14:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:07,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:07,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1663538501, now seen corresponding path program 1 times [2024-10-24 11:14:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206443367] [2024-10-24 11:14:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:07,268 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-10-24 11:14:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:07,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:07,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:14:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:07,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:14:07,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:07,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:14:07,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:14:08,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:08,465 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 56 treesize of output 46 [2024-10-24 11:14:09,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:09,184 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 63 treesize of output 58 [2024-10-24 11:14:09,336 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 17 treesize of output 13 [2024-10-24 11:14:09,523 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 55 treesize of output 43 [2024-10-24 11:14:10,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:10,162 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 141 treesize of output 71 [2024-10-24 11:14:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 452 proven. 39 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-24 11:14:10,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:10,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206443367] [2024-10-24 11:14:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206443367] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:14:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 28 [2024-10-24 11:14:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003585353] [2024-10-24 11:14:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:10,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:14:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:14:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:14:10,906 INFO L87 Difference]: Start difference. First operand 257 states and 350 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:17,942 INFO L93 Difference]: Finished difference Result 526 states and 714 transitions. [2024-10-24 11:14:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:14:17,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-10-24 11:14:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:17,945 INFO L225 Difference]: With dead ends: 526 [2024-10-24 11:14:17,945 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 11:14:17,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:14:17,946 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 455 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:17,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1246 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-10-24 11:14:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 11:14:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2024-10-24 11:14:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 280 states have (on average 1.292857142857143) internal successors, (362), 281 states have internal predecessors, (362), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 472 transitions. [2024-10-24 11:14:17,998 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 472 transitions. Word has length 167 [2024-10-24 11:14:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:17,999 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 472 transitions. [2024-10-24 11:14:17,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 472 transitions. [2024-10-24 11:14:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 11:14:18,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:18,000 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:18,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 11:14:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:18,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 508349524, now seen corresponding path program 1 times [2024-10-24 11:14:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448860839] [2024-10-24 11:14:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:18,202 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-10-24 11:14:18,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:18,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:18,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:14:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:14:18,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:18,699 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 14 treesize of output 10 [2024-10-24 11:14:18,984 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 52 treesize of output 24 [2024-10-24 11:14:19,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-10-24 11:14:19,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:19,385 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 35 treesize of output 37 [2024-10-24 11:14:21,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:21,529 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 86 treesize of output 68 [2024-10-24 11:14:22,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:22,138 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 173 treesize of output 99 [2024-10-24 11:14:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 298 proven. 114 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-10-24 11:14:22,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:22,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448860839] [2024-10-24 11:14:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448860839] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:22,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:14:22,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2024-10-24 11:14:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538409351] [2024-10-24 11:14:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:22,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:22,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:22,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:14:22,746 INFO L87 Difference]: Start difference. First operand 349 states and 472 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:23,001 INFO L93 Difference]: Finished difference Result 683 states and 927 transitions. [2024-10-24 11:14:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:14:23,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-24 11:14:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:23,005 INFO L225 Difference]: With dead ends: 683 [2024-10-24 11:14:23,005 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 11:14:23,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:14:23,006 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 35 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:23,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 11:14:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 383. [2024-10-24 11:14:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 314 states have (on average 1.286624203821656) internal successors, (404), 315 states have internal predecessors, (404), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 514 transitions. [2024-10-24 11:14:23,050 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 514 transitions. Word has length 172 [2024-10-24 11:14:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 514 transitions. [2024-10-24 11:14:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 514 transitions. [2024-10-24 11:14:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 11:14:23,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:23,056 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:23,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 11:14:23,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:23,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:23,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -742300906, now seen corresponding path program 1 times [2024-10-24 11:14:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:23,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768506185] [2024-10-24 11:14:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:23,258 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-10-24 11:14:23,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:23,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:23,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:14:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:14:23,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:23,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-24 11:14:23,680 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 32 treesize of output 20 [2024-10-24 11:14:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:23,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:23,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768506185] [2024-10-24 11:14:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768506185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689246565] [2024-10-24 11:14:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:23,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:14:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:14:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:14:23,705 INFO L87 Difference]: Start difference. First operand 383 states and 514 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:23,931 INFO L93 Difference]: Finished difference Result 933 states and 1260 transitions. [2024-10-24 11:14:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:14:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-10-24 11:14:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:23,936 INFO L225 Difference]: With dead ends: 933 [2024-10-24 11:14:23,936 INFO L226 Difference]: Without dead ends: 637 [2024-10-24 11:14:23,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:23,941 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 165 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:23,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 712 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-24 11:14:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 389. [2024-10-24 11:14:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 320 states have (on average 1.28125) internal successors, (410), 321 states have internal predecessors, (410), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 520 transitions. [2024-10-24 11:14:23,994 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 520 transitions. Word has length 174 [2024-10-24 11:14:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:23,994 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 520 transitions. [2024-10-24 11:14:23,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 520 transitions. [2024-10-24 11:14:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 11:14:24,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:24,000 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:24,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:24,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:24,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:24,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -424772842, now seen corresponding path program 1 times [2024-10-24 11:14:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589245841] [2024-10-24 11:14:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:24,202 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-10-24 11:14:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:24,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:24,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:14:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:24,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:24,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:24,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589245841] [2024-10-24 11:14:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589245841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978150154] [2024-10-24 11:14:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:24,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:14:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:14:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:14:24,823 INFO L87 Difference]: Start difference. First operand 389 states and 520 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:29,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:30,965 INFO L93 Difference]: Finished difference Result 929 states and 1244 transitions. [2024-10-24 11:14:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:14:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-10-24 11:14:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:30,969 INFO L225 Difference]: With dead ends: 929 [2024-10-24 11:14:30,969 INFO L226 Difference]: Without dead ends: 627 [2024-10-24 11:14:30,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:30,971 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 135 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:30,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 609 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-24 11:14:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-24 11:14:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 435. [2024-10-24 11:14:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 366 states have (on average 1.273224043715847) internal successors, (466), 367 states have internal predecessors, (466), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 576 transitions. [2024-10-24 11:14:31,007 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 576 transitions. Word has length 174 [2024-10-24 11:14:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 576 transitions. [2024-10-24 11:14:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 576 transitions. [2024-10-24 11:14:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 11:14:31,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:31,009 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:31,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:31,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:31,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:31,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -817799852, now seen corresponding path program 1 times [2024-10-24 11:14:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488905604] [2024-10-24 11:14:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:31,211 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-10-24 11:14:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:31,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:31,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Waiting until timeout for monitored process [2024-10-24 11:14:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:31,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:14:31,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:31,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:31,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488905604] [2024-10-24 11:14:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488905604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:14:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898876897] [2024-10-24 11:14:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:14:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:14:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:31,600 INFO L87 Difference]: Start difference. First operand 435 states and 576 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:31,694 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2024-10-24 11:14:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:14:31,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-10-24 11:14:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:31,697 INFO L225 Difference]: With dead ends: 795 [2024-10-24 11:14:31,697 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 11:14:31,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 171 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-10-24 11:14:31,698 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:31,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 11:14:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2024-10-24 11:14:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 372 states have (on average 1.2688172043010753) internal successors, (472), 373 states have internal predecessors, (472), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 582 transitions. [2024-10-24 11:14:31,723 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 582 transitions. Word has length 174 [2024-10-24 11:14:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:31,724 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 582 transitions. [2024-10-24 11:14:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 582 transitions. [2024-10-24 11:14:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 11:14:31,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:31,725 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:31,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:31,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:31,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2097089558, now seen corresponding path program 1 times [2024-10-24 11:14:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089155858] [2024-10-24 11:14:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:31,927 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-10-24 11:14:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:31,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:31,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Waiting until timeout for monitored process [2024-10-24 11:14:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:32,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:32,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:32,695 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 17 treesize of output 13 [2024-10-24 11:14:32,810 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 54 treesize of output 42 [2024-10-24 11:14:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:14:32,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:32,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089155858] [2024-10-24 11:14:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089155858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:14:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502816447] [2024-10-24 11:14:32,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:32,862 INFO L87 Difference]: Start difference. First operand 441 states and 582 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:37,469 INFO L93 Difference]: Finished difference Result 770 states and 1007 transitions. [2024-10-24 11:14:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:14:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-10-24 11:14:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:37,474 INFO L225 Difference]: With dead ends: 770 [2024-10-24 11:14:37,474 INFO L226 Difference]: Without dead ends: 768 [2024-10-24 11:14:37,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:14:37,476 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 114 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:37,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1037 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 11:14:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-24 11:14:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 591. [2024-10-24 11:14:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 522 states have (on average 1.2624521072796935) internal successors, (659), 523 states have internal predecessors, (659), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 11:14:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 769 transitions. [2024-10-24 11:14:37,524 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 769 transitions. Word has length 174 [2024-10-24 11:14:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:37,525 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 769 transitions. [2024-10-24 11:14:37,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:14:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 769 transitions. [2024-10-24 11:14:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 11:14:37,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:37,527 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:37,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:37,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:37,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash -352501990, now seen corresponding path program 1 times [2024-10-24 11:14:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230961593] [2024-10-24 11:14:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:37,728 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-10-24 11:14:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:37,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-24 11:14:37,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Waiting until timeout for monitored process