./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-p_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-p_file-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:16:52,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:16:52,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:16:52,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:16:52,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:16:52,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:16:52,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:16:52,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:16:52,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:16:52,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:16:52,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:16:52,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:16:52,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:16:52,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:16:52,535 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:16:52,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:16:52,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:16:52,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:16:52,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:16:52,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:16:52,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:16:52,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:16:52,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:16:52,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:16:52,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:16:52,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:16:52,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:16:52,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:16:52,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:16:52,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:16:52,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:16:52,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:16:52,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:52,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:16:52,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:16:52,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:16:52,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:16:52,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:16:52,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:16:52,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:16:52,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:16:52,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:16:52,545 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2024-10-13 06:16:52,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:16:52,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:16:52,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:16:52,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:16:52,794 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:16:52,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:16:54,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:16:54,558 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:16:54,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:16:54,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1c388dc/0e827a40dd114ec0b5841b2eaaa8624d/FLAGae9af99b8 [2024-10-13 06:16:54,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1c388dc/0e827a40dd114ec0b5841b2eaaa8624d [2024-10-13 06:16:54,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:16:54,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:16:54,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:54,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:16:54,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:16:54,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:54" (1/1) ... [2024-10-13 06:16:54,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ed13f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:54, skipping insertion in model container [2024-10-13 06:16:54,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:54" (1/1) ... [2024-10-13 06:16:54,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:16:55,110 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-p_file-31.i[916,929] [2024-10-13 06:16:55,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:55,172 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:16:55,182 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-p_file-31.i[916,929] [2024-10-13 06:16:55,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:55,226 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:16:55,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55 WrapperNode [2024-10-13 06:16:55,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:55,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:55,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:16:55,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:16:55,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,275 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2024-10-13 06:16:55,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:55,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:16:55,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:16:55,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:16:55,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,374 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2024-10-13 06:16:55,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:16:55,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:16:55,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:16:55,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:16:55,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (1/1) ... [2024-10-13 06:16:55,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:16:55,467 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-13 06:16:55,476 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-13 06:16:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:16:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:16:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:16:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:16:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:16:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:16:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:16:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:16:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:16:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:16:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:16:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:16:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:16:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:16:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:16:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:16:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:16:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:16:55,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:16:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:16:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:16:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:16:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:16:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:16:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:16:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:16:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:16:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:16:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:16:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:16:55,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:16:55,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:16:56,065 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-13 06:16:56,066 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:16:56,100 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:16:56,101 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:16:56,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:56 BoogieIcfgContainer [2024-10-13 06:16:56,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:16:56,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:16:56,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:16:56,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:16:56,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:16:54" (1/3) ... [2024-10-13 06:16:56,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2472f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:56, skipping insertion in model container [2024-10-13 06:16:56,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:55" (2/3) ... [2024-10-13 06:16:56,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2472f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:56, skipping insertion in model container [2024-10-13 06:16:56,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:56" (3/3) ... [2024-10-13 06:16:56,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:16:56,128 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:16:56,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:16:56,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:16:56,190 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;@50e8c3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:16:56,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:16:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:16:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:16:56,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:56,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:56,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 565448202, now seen corresponding path program 1 times [2024-10-13 06:16:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901956494] [2024-10-13 06:16:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:16:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:16:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:16:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901956494] [2024-10-13 06:16:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901956494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:56,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:56,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:16:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385543847] [2024-10-13 06:16:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:16:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:16:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:16:56,543 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:16:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:56,572 INFO L93 Difference]: Finished difference Result 157 states and 251 transitions. [2024-10-13 06:16:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:16:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-13 06:16:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:56,582 INFO L225 Difference]: With dead ends: 157 [2024-10-13 06:16:56,582 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 06:16:56,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-13 06:16:56,588 INFO L432 NwaCegarLoop]: 112 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, 112 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-13 06:16:56,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 06:16:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 06:16:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:16:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-13 06:16:56,690 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 89 [2024-10-13 06:16:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:56,691 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-13 06:16:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:16:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-13 06:16:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:16:56,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:56,694 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:56,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:16:56,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:56,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash -724558628, now seen corresponding path program 1 times [2024-10-13 06:16:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058991529] [2024-10-13 06:16:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:16:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:16:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:16:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:56,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058991529] [2024-10-13 06:16:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058991529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:56,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:16:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036240157] [2024-10-13 06:16:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:56,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:16:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:56,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:16:56,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:16:56,997 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:16:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:57,029 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2024-10-13 06:16:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-13 06:16:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:57,031 INFO L225 Difference]: With dead ends: 157 [2024-10-13 06:16:57,032 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 06:16:57,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:16:57,033 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:57,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 06:16:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 06:16:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:16:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-13 06:16:57,041 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 89 [2024-10-13 06:16:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:57,042 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-13 06:16:57,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:16:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-13 06:16:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:16:57,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:57,045 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:16:57,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1647180634, now seen corresponding path program 1 times [2024-10-13 06:16:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311100975] [2024-10-13 06:16:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:16:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:16:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:16:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311100975] [2024-10-13 06:16:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311100975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:16:57,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351326230] [2024-10-13 06:16:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:57,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:16:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:16:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:16:57,385 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:16:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:57,404 INFO L93 Difference]: Finished difference Result 159 states and 235 transitions. [2024-10-13 06:16:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:16:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2024-10-13 06:16:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:57,406 INFO L225 Difference]: With dead ends: 159 [2024-10-13 06:16:57,406 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 06:16:57,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:16:57,408 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:57,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 06:16:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 06:16:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:16:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-10-13 06:16:57,415 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 89 [2024-10-13 06:16:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-10-13 06:16:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:16:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-10-13 06:16:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:16:57,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:57,417 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:57,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:16:57,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 626112280, now seen corresponding path program 1 times [2024-10-13 06:16:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105286283] [2024-10-13 06:16:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:16:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:16:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:16:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105286283] [2024-10-13 06:16:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105286283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:16:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360810228] [2024-10-13 06:16:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:16:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:16:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:16:58,780 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:16:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:59,157 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2024-10-13 06:16:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:16:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2024-10-13 06:16:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:59,160 INFO L225 Difference]: With dead ends: 201 [2024-10-13 06:16:59,162 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 06:16:59,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:16:59,164 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 337 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:59,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 597 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:16:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 06:16:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-10-13 06:16:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:16:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-10-13 06:16:59,189 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 89 [2024-10-13 06:16:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:59,189 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-10-13 06:16:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:16:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-10-13 06:16:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:16:59,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:59,191 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:59,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:16:59,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1422802691, now seen corresponding path program 1 times [2024-10-13 06:16:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698946133] [2024-10-13 06:16:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:16:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:16:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:16:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698946133] [2024-10-13 06:16:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698946133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:59,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:59,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:16:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719680848] [2024-10-13 06:16:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:16:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:59,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:16:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:16:59,436 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:16:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:59,486 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2024-10-13 06:16:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:59,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:16:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:59,515 INFO L225 Difference]: With dead ends: 237 [2024-10-13 06:16:59,516 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:16:59,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-13 06:16:59,518 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:59,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:16:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:16:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 104 states have internal predecessors, (144), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:16:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2024-10-13 06:16:59,541 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 91 [2024-10-13 06:16:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:59,543 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-10-13 06:16:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:16:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-10-13 06:16:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:16:59,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:59,548 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:16:59,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:16:59,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:59,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash -742744321, now seen corresponding path program 1 times [2024-10-13 06:16:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589965522] [2024-10-13 06:16:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:16:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:16:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:16:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:16:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:16:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:16:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:00,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589965522] [2024-10-13 06:17:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589965522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:00,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:17:00,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634066701] [2024-10-13 06:17:00,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:00,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:17:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:17:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:17:00,018 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:00,169 INFO L93 Difference]: Finished difference Result 250 states and 355 transitions. [2024-10-13 06:17:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:00,172 INFO L225 Difference]: With dead ends: 250 [2024-10-13 06:17:00,173 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:17:00,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:17:00,175 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 63 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:00,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 533 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:17:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 94. [2024-10-13 06:17:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.358974358974359) internal successors, (106), 79 states have internal predecessors, (106), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-13 06:17:00,196 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 91 [2024-10-13 06:17:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-13 06:17:00,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-13 06:17:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:00,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:00,199 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:00,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:17:00,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:00,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1669762258, now seen corresponding path program 1 times [2024-10-13 06:17:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090264351] [2024-10-13 06:17:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090264351] [2024-10-13 06:17:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090264351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:00,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:17:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972324630] [2024-10-13 06:17:00,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:17:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:17:00,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:00,304 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:00,327 INFO L93 Difference]: Finished difference Result 184 states and 259 transitions. [2024-10-13 06:17:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:17:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:00,332 INFO L225 Difference]: With dead ends: 184 [2024-10-13 06:17:00,335 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 06:17:00,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:00,336 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:00,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 06:17:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 06:17:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 80 states have internal predecessors, (107), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2024-10-13 06:17:00,355 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 91 [2024-10-13 06:17:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2024-10-13 06:17:00,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2024-10-13 06:17:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:00,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:00,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:17:00,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1927927696, now seen corresponding path program 1 times [2024-10-13 06:17:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037414173] [2024-10-13 06:17:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037414173] [2024-10-13 06:17:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037414173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:17:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218324001] [2024-10-13 06:17:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:00,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:00,566 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:00,659 INFO L93 Difference]: Finished difference Result 217 states and 303 transitions. [2024-10-13 06:17:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:00,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:00,663 INFO L225 Difference]: With dead ends: 217 [2024-10-13 06:17:00,663 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 06:17:00,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:00,668 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:00,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 06:17:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-10-13 06:17:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-13 06:17:00,685 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 91 [2024-10-13 06:17:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:00,685 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-13 06:17:00,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-13 06:17:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 06:17:00,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:00,693 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:17:00,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1582407252, now seen corresponding path program 1 times [2024-10-13 06:17:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051174016] [2024-10-13 06:17:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051174016] [2024-10-13 06:17:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051174016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:17:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500271630] [2024-10-13 06:17:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:00,921 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:01,022 INFO L93 Difference]: Finished difference Result 210 states and 290 transitions. [2024-10-13 06:17:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2024-10-13 06:17:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:01,027 INFO L225 Difference]: With dead ends: 210 [2024-10-13 06:17:01,027 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 06:17:01,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:01,028 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 36 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:01,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 413 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 06:17:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2024-10-13 06:17:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 80 states have internal predecessors, (105), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-10-13 06:17:01,059 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 92 [2024-10-13 06:17:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:01,060 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-10-13 06:17:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-10-13 06:17:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:17:01,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:01,063 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:01,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:17:01,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:01,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash -79667788, now seen corresponding path program 1 times [2024-10-13 06:17:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211509888] [2024-10-13 06:17:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211509888] [2024-10-13 06:17:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211509888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:17:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947741725] [2024-10-13 06:17:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:17:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:17:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:17:01,498 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:01,638 INFO L93 Difference]: Finished difference Result 262 states and 358 transitions. [2024-10-13 06:17:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2024-10-13 06:17:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:01,640 INFO L225 Difference]: With dead ends: 262 [2024-10-13 06:17:01,640 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 06:17:01,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:17:01,641 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:01,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 674 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 06:17:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2024-10-13 06:17:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 145 states have internal predecessors, (189), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:17:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2024-10-13 06:17:01,652 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 93 [2024-10-13 06:17:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:01,652 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2024-10-13 06:17:01,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2024-10-13 06:17:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:01,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:01,654 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:17:01,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 410782428, now seen corresponding path program 1 times [2024-10-13 06:17:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471705301] [2024-10-13 06:17:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:01,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471705301] [2024-10-13 06:17:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471705301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:17:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709459204] [2024-10-13 06:17:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:01,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:01,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:01,860 INFO L87 Difference]: Start difference. First operand 169 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:01,933 INFO L93 Difference]: Finished difference Result 436 states and 589 transitions. [2024-10-13 06:17:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:01,936 INFO L225 Difference]: With dead ends: 436 [2024-10-13 06:17:01,936 INFO L226 Difference]: Without dead ends: 272 [2024-10-13 06:17:01,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-13 06:17:01,937 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 56 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:01,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 449 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-13 06:17:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2024-10-13 06:17:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 234 states have internal predecessors, (298), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 356 transitions. [2024-10-13 06:17:01,956 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 356 transitions. Word has length 94 [2024-10-13 06:17:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:01,956 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 356 transitions. [2024-10-13 06:17:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 356 transitions. [2024-10-13 06:17:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:01,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:01,958 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:17:01,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1370012444, now seen corresponding path program 1 times [2024-10-13 06:17:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190946013] [2024-10-13 06:17:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:02,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190946013] [2024-10-13 06:17:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190946013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:02,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:17:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972507923] [2024-10-13 06:17:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:02,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:02,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:02,090 INFO L87 Difference]: Start difference. First operand 268 states and 356 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:02,131 INFO L93 Difference]: Finished difference Result 533 states and 707 transitions. [2024-10-13 06:17:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:02,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:02,133 INFO L225 Difference]: With dead ends: 533 [2024-10-13 06:17:02,133 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 06:17:02,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:02,134 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:02,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 06:17:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2024-10-13 06:17:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 228 states have (on average 1.280701754385965) internal successors, (292), 232 states have internal predecessors, (292), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 350 transitions. [2024-10-13 06:17:02,153 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 350 transitions. Word has length 94 [2024-10-13 06:17:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:02,153 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 350 transitions. [2024-10-13 06:17:02,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 350 transitions. [2024-10-13 06:17:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:02,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:02,154 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:17:02,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1583252836, now seen corresponding path program 1 times [2024-10-13 06:17:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269420952] [2024-10-13 06:17:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269420952] [2024-10-13 06:17:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269420952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:02,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:17:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672924918] [2024-10-13 06:17:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:02,334 INFO L87 Difference]: Start difference. First operand 266 states and 350 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:02,457 INFO L93 Difference]: Finished difference Result 620 states and 811 transitions. [2024-10-13 06:17:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:17:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:02,460 INFO L225 Difference]: With dead ends: 620 [2024-10-13 06:17:02,460 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 06:17:02,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 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-13 06:17:02,461 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 47 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:02,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 667 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 06:17:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 274. [2024-10-13 06:17:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 240 states have internal predecessors, (304), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 362 transitions. [2024-10-13 06:17:02,479 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 362 transitions. Word has length 94 [2024-10-13 06:17:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:02,479 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 362 transitions. [2024-10-13 06:17:02,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 362 transitions. [2024-10-13 06:17:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:02,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:02,481 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:02,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:17:02,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:02,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:02,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1431850782, now seen corresponding path program 1 times [2024-10-13 06:17:02,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999011870] [2024-10-13 06:17:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:02,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:02,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999011870] [2024-10-13 06:17:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999011870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:02,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:17:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94842508] [2024-10-13 06:17:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:02,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:02,684 INFO L87 Difference]: Start difference. First operand 274 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:02,817 INFO L93 Difference]: Finished difference Result 613 states and 801 transitions. [2024-10-13 06:17:02,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:02,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:02,820 INFO L225 Difference]: With dead ends: 613 [2024-10-13 06:17:02,820 INFO L226 Difference]: Without dead ends: 344 [2024-10-13 06:17:02,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-13 06:17:02,822 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:02,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 547 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-13 06:17:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 258. [2024-10-13 06:17:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 222 states have (on average 1.2792792792792793) internal successors, (284), 225 states have internal predecessors, (284), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 06:17:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 338 transitions. [2024-10-13 06:17:02,842 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 338 transitions. Word has length 94 [2024-10-13 06:17:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:02,842 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 338 transitions. [2024-10-13 06:17:02,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 338 transitions. [2024-10-13 06:17:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:02,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:02,844 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:17:02,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1560000385, now seen corresponding path program 1 times [2024-10-13 06:17:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199102143] [2024-10-13 06:17:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:17:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147788402] [2024-10-13 06:17:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:17:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:17:02,904 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-13 06:17:02,913 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-13 06:17:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:03,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 06:17:03,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:03,352 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-13 06:17:03,498 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-13 06:17:03,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-13 06:17:03,649 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-13 06:17:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 06:17:03,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199102143] [2024-10-13 06:17:03,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:17:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147788402] [2024-10-13 06:17:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147788402] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-10-13 06:17:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634150963] [2024-10-13 06:17:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:03,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:03,820 INFO L87 Difference]: Start difference. First operand 258 states and 338 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:03,948 INFO L93 Difference]: Finished difference Result 595 states and 782 transitions. [2024-10-13 06:17:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:03,953 INFO L225 Difference]: With dead ends: 595 [2024-10-13 06:17:03,953 INFO L226 Difference]: Without dead ends: 338 [2024-10-13 06:17:03,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:17:03,955 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 98 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 383 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-13 06:17:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 300. [2024-10-13 06:17:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 267 states have internal predecessors, (334), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 06:17:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 388 transitions. [2024-10-13 06:17:03,978 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 388 transitions. Word has length 94 [2024-10-13 06:17:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 388 transitions. [2024-10-13 06:17:03,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 388 transitions. [2024-10-13 06:17:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:17:03,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:03,980 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:04,000 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-13 06:17:04,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 06:17:04,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1875781786, now seen corresponding path program 1 times [2024-10-13 06:17:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87852067] [2024-10-13 06:17:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:17:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:17:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:17:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:17:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:17:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:17:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:17:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:17:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:17:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:17:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:17:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:17:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87852067] [2024-10-13 06:17:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87852067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:17:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940233641] [2024-10-13 06:17:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:04,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:17:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:04,320 INFO L87 Difference]: Start difference. First operand 300 states and 388 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:04,369 INFO L93 Difference]: Finished difference Result 615 states and 795 transitions. [2024-10-13 06:17:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2024-10-13 06:17:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:04,371 INFO L225 Difference]: With dead ends: 615 [2024-10-13 06:17:04,371 INFO L226 Difference]: Without dead ends: 316 [2024-10-13 06:17:04,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:04,372 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-13 06:17:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 310. [2024-10-13 06:17:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 274 states have (on average 1.2554744525547445) internal successors, (344), 277 states have internal predecessors, (344), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 06:17:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 398 transitions. [2024-10-13 06:17:04,389 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 398 transitions. Word has length 95 [2024-10-13 06:17:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:04,391 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 398 transitions. [2024-10-13 06:17:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 398 transitions. [2024-10-13 06:17:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:17:04,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:04,393 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:17:04,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -127056785, now seen corresponding path program 1 times [2024-10-13 06:17:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:17:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043455873] [2024-10-13 06:17:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:17:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:17:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208229664] [2024-10-13 06:17:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:17:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:17:04,475 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-13 06:17:04,477 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-13 06:17:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:17:04,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:17:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:17:04,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:17:04,864 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:17:04,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:17:04,885 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-13 06:17:05,066 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,SelfDestructingSolverStorable16 [2024-10-13 06:17:05,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:05,161 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:17:05,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:17:05 BoogieIcfgContainer [2024-10-13 06:17:05,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:17:05,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:17:05,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:17:05,164 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:17:05,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:56" (3/4) ... [2024-10-13 06:17:05,166 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:17:05,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:17:05,167 INFO L158 Benchmark]: Toolchain (without parser) took 10221.90ms. Allocated memory was 180.4MB in the beginning and 459.3MB in the end (delta: 278.9MB). Free memory was 112.2MB in the beginning and 397.1MB in the end (delta: -284.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:17:05,167 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.40ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 97.0MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.55ms. Allocated memory is still 180.4MB. Free memory was 97.0MB in the beginning and 93.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: Boogie Preprocessor took 148.47ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 150.1MB in the end (delta: -56.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: RCFGBuilder took 675.51ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 110.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: TraceAbstraction took 9060.33ms. Allocated memory was 180.4MB in the beginning and 459.3MB in the end (delta: 278.9MB). Free memory was 109.0MB in the beginning and 397.1MB in the end (delta: -288.1MB). Peak memory consumption was 230.9MB. Max. memory is 16.1GB. [2024-10-13 06:17:05,168 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 459.3MB. Free memory is still 397.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:17:05,169 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.13ms. Allocated memory is still 180.4MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.40ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 97.0MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.55ms. Allocated memory is still 180.4MB. Free memory was 97.0MB in the beginning and 93.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.47ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 150.1MB in the end (delta: -56.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 675.51ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 110.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9060.33ms. Allocated memory was 180.4MB in the beginning and 459.3MB in the end (delta: 278.9MB). Free memory was 109.0MB in the beginning and 397.1MB in the end (delta: -288.1MB). Peak memory consumption was 230.9MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 459.3MB. Free memory is still 397.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L22] signed long int var_1_1 = 200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed long int var_1_3 = 1107940323; [L26] signed long int var_1_3 = 1107940323; [L27] signed long int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 0; [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = 4; [L30] signed long int var_1_7 = 4; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = -32; [L32] signed long int var_1_8 = -32; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 64; [L34] unsigned char var_1_9 = 64; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_12 = 4; [L36] unsigned char var_1_12 = 4; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 0.97; [L38] double var_1_13 = 0.97; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] double var_1_14 = 32.6; [L40] double var_1_14 = 32.6; [L41] double* var_1_14_Pointer = &(var_1_14); [L42] signed long int last_1_var_1_7 = 4; [L43] double last_1_var_1_13 = 0.97; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR \read(var_1_7) [L102] last_1_var_1_7 = var_1_7 [L103] EXPR \read(var_1_13) [L103] last_1_var_1_13 = var_1_13 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_3 = __VERIFIER_nondet_long() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_8 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_12 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_14 = __VERIFIER_nondet_double() [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET updateVariables() [L115] CALL step() [L47] EXPR \read(*var_1_3_Pointer) [L47] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L47] COND FALSE !(! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) [L54] EXPR \read(*var_1_12_Pointer) [L54] (*(var_1_9_Pointer)) = (*(var_1_12_Pointer)) [L56] EXPR \read(*var_1_9_Pointer) [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_3_Pointer) [L59] (*(var_1_7_Pointer)) = ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_9_Pointer) [L61] EXPR \read(*var_1_3_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L61] COND FALSE !(((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_14_Pointer) [L72] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L74] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND TRUE (*(var_1_2_Pointer)) [L75] EXPR \read(*var_1_3_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] (*(var_1_1_Pointer)) = (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) [L106] EXPR \read(*var_1_7_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_12_Pointer) [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) [L106] EXPR \read(*var_1_13_Pointer) [L106] EXPR \read(*var_1_14_Pointer) [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106-L107] return ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 807 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 6915 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5013 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1178 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 1902 mSDtfsCounter, 1178 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 634 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=16, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 324 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 3226 SizeOfPredicates, 14 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 3588/3740 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-13 06:17:05,193 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-p_file-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:17:07,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:17:07,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:17:07,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:17:07,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:17:07,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:17:07,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:17:07,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:17:07,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:17:07,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:17:07,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:17:07,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:17:07,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:17:07,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:17:07,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:17:07,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:17:07,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:17:07,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:17:07,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:17:07,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:17:07,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:17:07,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:17:07,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:17:07,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:17:07,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:17:07,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:17:07,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:17:07,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:17:07,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:17:07,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:17:07,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:17:07,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:17:07,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:17:07,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:17:07,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:17:07,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:17:07,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:17:07,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:17:07,828 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:17:07,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:07,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:17:07,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:17:07,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:17:07,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:17:07,830 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:17:07,830 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2024-10-13 06:17:08,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:17:08,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:17:08,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:17:08,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:17:08,170 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:17:08,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:17:10,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:17:10,683 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:17:10,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:17:10,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/022525d00/39ae7e8f830f4cc8ba580f5275314246/FLAG810a85b13 [2024-10-13 06:17:11,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/022525d00/39ae7e8f830f4cc8ba580f5275314246 [2024-10-13 06:17:11,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:17:11,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:17:11,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:17:11,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:17:11,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:17:11,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e48312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11, skipping insertion in model container [2024-10-13 06:17:11,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:17:11,201 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-p_file-31.i[916,929] [2024-10-13 06:17:11,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:17:11,278 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:17:11,292 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-p_file-31.i[916,929] [2024-10-13 06:17:11,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:17:11,339 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:17:11,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11 WrapperNode [2024-10-13 06:17:11,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:17:11,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:17:11,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:17:11,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:17:11,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,392 INFO L138 Inliner]: procedures = 33, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2024-10-13 06:17:11,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:17:11,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:17:11,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:17:11,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:17:11,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,453 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2024-10-13 06:17:11,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:17:11,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:17:11,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:17:11,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:17:11,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (1/1) ... [2024-10-13 06:17:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:17:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:17:11,523 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-13 06:17:11,526 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-13 06:17:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:17:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:17:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-13 06:17:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 06:17:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:17:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-13 06:17:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:17:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 06:17:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 06:17:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:17:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-13 06:17:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:17:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:17:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:17:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:17:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:17:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:17:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:17:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 06:17:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-13 06:17:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-13 06:17:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-13 06:17:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-13 06:17:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-13 06:17:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-13 06:17:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-13 06:17:11,763 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:17:11,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:17:12,296 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-13 06:17:12,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:17:12,344 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:17:12,345 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:17:12,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:17:12 BoogieIcfgContainer [2024-10-13 06:17:12,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:17:12,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:17:12,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:17:12,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:17:12,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:17:11" (1/3) ... [2024-10-13 06:17:12,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb55e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:17:12, skipping insertion in model container [2024-10-13 06:17:12,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:17:11" (2/3) ... [2024-10-13 06:17:12,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb55e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:17:12, skipping insertion in model container [2024-10-13 06:17:12,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:17:12" (3/3) ... [2024-10-13 06:17:12,353 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2024-10-13 06:17:12,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:17:12,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:17:12,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:17:12,435 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;@67e043aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:17:12,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:17:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:17:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:17:12,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:12,449 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:12,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 565448202, now seen corresponding path program 1 times [2024-10-13 06:17:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860787567] [2024-10-13 06:17:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:12,470 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-13 06:17:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:12,473 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-13 06:17:12,474 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-13 06:17:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:12,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:17:12,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 06:17:12,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:12,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860787567] [2024-10-13 06:17:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860787567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:17:12,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994014907] [2024-10-13 06:17:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:17:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:17:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:17:12,806 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:12,845 INFO L93 Difference]: Finished difference Result 154 states and 246 transitions. [2024-10-13 06:17:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:17:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-13 06:17:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:12,856 INFO L225 Difference]: With dead ends: 154 [2024-10-13 06:17:12,857 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 06:17:12,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-13 06:17:12,865 INFO L432 NwaCegarLoop]: 105 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, 105 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-13 06:17:12,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 06:17:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 06:17:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:17:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-13 06:17:12,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 89 [2024-10-13 06:17:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-13 06:17:12,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-13 06:17:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:17:12,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:12,908 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:12,917 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-13 06:17:13,111 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-13 06:17:13,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -724558628, now seen corresponding path program 1 times [2024-10-13 06:17:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775170715] [2024-10-13 06:17:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:13,116 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-13 06:17:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:13,119 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-13 06:17:13,156 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-13 06:17:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:13,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:17:13,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:13,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:13,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:13,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775170715] [2024-10-13 06:17:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775170715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:17:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031050306] [2024-10-13 06:17:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:17:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:17:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:17:13,405 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:13,468 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-10-13 06:17:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:17:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-13 06:17:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:13,470 INFO L225 Difference]: With dead ends: 151 [2024-10-13 06:17:13,470 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 06:17:13,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-13 06:17:13,471 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:13,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 06:17:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 06:17:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:17:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-10-13 06:17:13,479 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 89 [2024-10-13 06:17:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:13,480 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-10-13 06:17:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-10-13 06:17:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:17:13,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:13,483 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:13,499 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:13,685 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-13 06:17:13,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1647180634, now seen corresponding path program 1 times [2024-10-13 06:17:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201921247] [2024-10-13 06:17:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:13,688 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-13 06:17:13,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:13,692 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-13 06:17:13,694 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-13 06:17:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:13,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:17:13,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:13,992 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-13 06:17:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:14,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:14,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201921247] [2024-10-13 06:17:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201921247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:14,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:14,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:17:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670779194] [2024-10-13 06:17:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:14,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:17:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:17:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:14,024 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:14,077 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2024-10-13 06:17:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:17:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2024-10-13 06:17:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:14,079 INFO L225 Difference]: With dead ends: 153 [2024-10-13 06:17:14,079 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 06:17:14,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:14,080 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:14,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 06:17:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 06:17:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:17:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 110 transitions. [2024-10-13 06:17:14,097 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 110 transitions. Word has length 89 [2024-10-13 06:17:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:14,098 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 110 transitions. [2024-10-13 06:17:14,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 110 transitions. [2024-10-13 06:17:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 06:17:14,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:14,100 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:14,110 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 (4)] Ended with exit code 0 [2024-10-13 06:17:14,300 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-13 06:17:14,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash 626112280, now seen corresponding path program 1 times [2024-10-13 06:17:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818700168] [2024-10-13 06:17:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:14,303 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-13 06:17:14,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:14,307 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-13 06:17:14,312 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-13 06:17:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:14,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:17:14,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:14,756 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 26 treesize of output 22 [2024-10-13 06:17:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:14,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:14,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818700168] [2024-10-13 06:17:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818700168] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-13 06:17:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606136269] [2024-10-13 06:17:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:14,998 INFO L87 Difference]: Start difference. First operand 77 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:15,267 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-10-13 06:17:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2024-10-13 06:17:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:15,269 INFO L225 Difference]: With dead ends: 193 [2024-10-13 06:17:15,269 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 06:17:15,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:17:15,271 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:15,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 388 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:17:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 06:17:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-13 06:17:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 99 states have internal predecessors, (135), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-10-13 06:17:15,283 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 89 [2024-10-13 06:17:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:15,284 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-10-13 06:17:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-10-13 06:17:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:15,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:15,286 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:15,297 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-13 06:17:15,490 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-13 06:17:15,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:15,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1422802691, now seen corresponding path program 1 times [2024-10-13 06:17:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930661025] [2024-10-13 06:17:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:15,492 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-13 06:17:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:15,498 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-13 06:17:15,499 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-13 06:17:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:15,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:17:15,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:15,783 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-13 06:17:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:15,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:15,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930661025] [2024-10-13 06:17:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930661025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:17:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441969935] [2024-10-13 06:17:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:17:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:17:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:15,799 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:15,835 INFO L93 Difference]: Finished difference Result 227 states and 321 transitions. [2024-10-13 06:17:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:17:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:15,838 INFO L225 Difference]: With dead ends: 227 [2024-10-13 06:17:15,838 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:17:15,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:15,839 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:15,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:17:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-13 06:17:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-10-13 06:17:15,847 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 91 [2024-10-13 06:17:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:15,848 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-10-13 06:17:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-10-13 06:17:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:15,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:15,849 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:15,857 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-13 06:17:16,052 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-13 06:17:16,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -742744321, now seen corresponding path program 1 times [2024-10-13 06:17:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777660496] [2024-10-13 06:17:16,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:16,056 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-13 06:17:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:16,063 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-13 06:17:16,064 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-13 06:17:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:16,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:17:16,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:16,415 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 24 treesize of output 20 [2024-10-13 06:17:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:16,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:16,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777660496] [2024-10-13 06:17:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777660496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:16,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:17:16,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664788662] [2024-10-13 06:17:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:16,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:16,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:16,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:16,615 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:16,886 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2024-10-13 06:17:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:16,887 INFO L225 Difference]: With dead ends: 240 [2024-10-13 06:17:16,888 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 06:17:16,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 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-13 06:17:16,889 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 59 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:16,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 423 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:17:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 06:17:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-10-13 06:17:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.32) internal successors, (99), 76 states have internal predecessors, (99), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-10-13 06:17:16,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 91 [2024-10-13 06:17:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:16,897 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-10-13 06:17:16,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-10-13 06:17:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:16,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:16,899 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:16,911 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-13 06:17:17,099 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-13 06:17:17,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1669762258, now seen corresponding path program 1 times [2024-10-13 06:17:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307977277] [2024-10-13 06:17:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:17,101 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-13 06:17:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:17,103 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-13 06:17:17,104 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-13 06:17:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:17,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 06:17:17,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:17,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:17,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:17,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307977277] [2024-10-13 06:17:17,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307977277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:17,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:17:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329093586] [2024-10-13 06:17:17,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:17,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:17:17,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:17,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:17:17,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:17,331 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:17,356 INFO L93 Difference]: Finished difference Result 178 states and 245 transitions. [2024-10-13 06:17:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:17:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:17,357 INFO L225 Difference]: With dead ends: 178 [2024-10-13 06:17:17,357 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 06:17:17,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:17:17,358 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:17,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 06:17:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 06:17:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2024-10-13 06:17:17,366 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 91 [2024-10-13 06:17:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:17,366 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2024-10-13 06:17:17,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2024-10-13 06:17:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 06:17:17,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:17,367 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:17,379 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 (8)] Ended with exit code 0 [2024-10-13 06:17:17,571 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-13 06:17:17,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:17,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1927927696, now seen corresponding path program 1 times [2024-10-13 06:17:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570852169] [2024-10-13 06:17:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:17,573 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-13 06:17:17,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:17,576 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-13 06:17:17,577 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-13 06:17:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:17,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:17:17,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 06:17:18,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:18,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570852169] [2024-10-13 06:17:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570852169] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:18,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-13 06:17:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352958985] [2024-10-13 06:17:18,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:18,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:17:18,342 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:18,447 INFO L93 Difference]: Finished difference Result 209 states and 285 transitions. [2024-10-13 06:17:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-13 06:17:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:18,451 INFO L225 Difference]: With dead ends: 209 [2024-10-13 06:17:18,452 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 06:17:18,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:18,454 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:18,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 453 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 06:17:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2024-10-13 06:17:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2024-10-13 06:17:18,475 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 91 [2024-10-13 06:17:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:18,476 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2024-10-13 06:17:18,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2024-10-13 06:17:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 06:17:18,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:18,477 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:18,495 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-13 06:17:18,677 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-13 06:17:18,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:18,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1582407252, now seen corresponding path program 1 times [2024-10-13 06:17:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769558776] [2024-10-13 06:17:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:18,680 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-13 06:17:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:18,682 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-13 06:17:18,683 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-13 06:17:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:18,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:17:18,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:19,081 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 27 treesize of output 15 [2024-10-13 06:17:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 06:17:19,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:19,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769558776] [2024-10-13 06:17:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769558776] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-13 06:17:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530126061] [2024-10-13 06:17:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:17:19,183 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:19,255 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2024-10-13 06:17:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2024-10-13 06:17:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:19,256 INFO L225 Difference]: With dead ends: 202 [2024-10-13 06:17:19,256 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 06:17:19,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:17:19,257 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 32 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:19,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 385 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 06:17:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2024-10-13 06:17:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 77 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 06:17:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2024-10-13 06:17:19,263 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 92 [2024-10-13 06:17:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:19,264 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-10-13 06:17:19,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2024-10-13 06:17:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:17:19,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:19,265 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:19,276 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:19,469 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-13 06:17:19,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:19,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash -79667788, now seen corresponding path program 1 times [2024-10-13 06:17:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166849830] [2024-10-13 06:17:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:19,471 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-13 06:17:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:19,472 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-13 06:17:19,474 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-13 06:17:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:19,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:17:19,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:19,977 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-13 06:17:20,022 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-13 06:17:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-13 06:17:20,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:20,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:20,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166849830] [2024-10-13 06:17:20,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166849830] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:20,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:20,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-10-13 06:17:20,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961970227] [2024-10-13 06:17:20,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:20,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:20,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:20,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:17:20,131 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:20,303 INFO L93 Difference]: Finished difference Result 254 states and 340 transitions. [2024-10-13 06:17:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2024-10-13 06:17:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:20,305 INFO L225 Difference]: With dead ends: 254 [2024-10-13 06:17:20,305 INFO L226 Difference]: Without dead ends: 167 [2024-10-13 06:17:20,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:20,306 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 74 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:20,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 544 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-13 06:17:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-13 06:17:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.289855072463768) internal successors, (178), 140 states have internal predecessors, (178), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:17:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 220 transitions. [2024-10-13 06:17:20,335 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 220 transitions. Word has length 93 [2024-10-13 06:17:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:20,335 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 220 transitions. [2024-10-13 06:17:20,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 220 transitions. [2024-10-13 06:17:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:20,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:20,336 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:20,345 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-13 06:17:20,537 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-13 06:17:20,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 410782428, now seen corresponding path program 1 times [2024-10-13 06:17:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768757246] [2024-10-13 06:17:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:20,539 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-13 06:17:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:20,542 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-13 06:17:20,543 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-13 06:17:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:20,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:17:20,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 5 proven. 135 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 06:17:21,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:21,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768757246] [2024-10-13 06:17:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768757246] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-13 06:17:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91204707] [2024-10-13 06:17:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:17:21,187 INFO L87 Difference]: Start difference. First operand 164 states and 220 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:21,280 INFO L93 Difference]: Finished difference Result 422 states and 559 transitions. [2024-10-13 06:17:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:21,283 INFO L225 Difference]: With dead ends: 422 [2024-10-13 06:17:21,283 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 06:17:21,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:21,284 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 95 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:21,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 326 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 06:17:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2024-10-13 06:17:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 221 states have (on average 1.262443438914027) internal successors, (279), 225 states have internal predecessors, (279), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 337 transitions. [2024-10-13 06:17:21,298 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 337 transitions. Word has length 94 [2024-10-13 06:17:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:21,299 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 337 transitions. [2024-10-13 06:17:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 337 transitions. [2024-10-13 06:17:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:21,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:21,300 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:21,309 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:21,504 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-13 06:17:21,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:21,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1370012444, now seen corresponding path program 1 times [2024-10-13 06:17:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247996703] [2024-10-13 06:17:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:21,506 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-13 06:17:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:21,522 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-13 06:17:21,524 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-13 06:17:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:21,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:17:21,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:21,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:21,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247996703] [2024-10-13 06:17:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247996703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:21,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:21,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:17:21,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889829824] [2024-10-13 06:17:21,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:21,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:21,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:21,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:21,754 INFO L87 Difference]: Start difference. First operand 259 states and 337 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:21,807 INFO L93 Difference]: Finished difference Result 515 states and 669 transitions. [2024-10-13 06:17:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:21,809 INFO L225 Difference]: With dead ends: 515 [2024-10-13 06:17:21,809 INFO L226 Difference]: Without dead ends: 261 [2024-10-13 06:17:21,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:21,811 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:21,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:17:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-13 06:17:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2024-10-13 06:17:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 219 states have (on average 1.2465753424657535) internal successors, (273), 223 states have internal predecessors, (273), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 331 transitions. [2024-10-13 06:17:21,826 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 331 transitions. Word has length 94 [2024-10-13 06:17:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 331 transitions. [2024-10-13 06:17:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 331 transitions. [2024-10-13 06:17:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:21,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:21,828 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:21,835 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 (13)] Ended with exit code 0 [2024-10-13 06:17:22,031 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-13 06:17:22,032 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1583252836, now seen corresponding path program 1 times [2024-10-13 06:17:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541565993] [2024-10-13 06:17:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:22,033 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-13 06:17:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:22,036 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-13 06:17:22,037 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-13 06:17:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:22,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:17:22,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:22,571 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 31 treesize of output 19 [2024-10-13 06:17:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:22,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:22,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541565993] [2024-10-13 06:17:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541565993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [388429760] [2024-10-13 06:17:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:22,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:17:22,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:17:22,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-13 06:17:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:23,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:17:23,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:23,359 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-13 06:17:23,554 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-13 06:17:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-13 06:17:23,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [388429760] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:23,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:17:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2024-10-13 06:17:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380182394] [2024-10-13 06:17:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:23,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:23,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:17:23,737 INFO L87 Difference]: Start difference. First operand 257 states and 331 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:23,931 INFO L93 Difference]: Finished difference Result 598 states and 765 transitions. [2024-10-13 06:17:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:17:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:23,934 INFO L225 Difference]: With dead ends: 598 [2024-10-13 06:17:23,934 INFO L226 Difference]: Without dead ends: 346 [2024-10-13 06:17:23,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:17:23,935 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 43 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:23,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 616 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-13 06:17:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2024-10-13 06:17:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 227 states have (on average 1.2555066079295154) internal successors, (285), 231 states have internal predecessors, (285), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2024-10-13 06:17:23,949 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 94 [2024-10-13 06:17:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2024-10-13 06:17:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2024-10-13 06:17:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:23,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:23,950 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-10-13 06:17:24,163 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 (14)] Ended with exit code 0 [2024-10-13 06:17:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-13 06:17:24,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1431850782, now seen corresponding path program 1 times [2024-10-13 06:17:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343955202] [2024-10-13 06:17:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:24,357 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-13 06:17:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:24,359 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-13 06:17:24,360 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-13 06:17:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:24,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:17:24,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:24,762 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 31 treesize of output 19 [2024-10-13 06:17:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:24,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:24,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343955202] [2024-10-13 06:17:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343955202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [578649249] [2024-10-13 06:17:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:24,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:17:24,840 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:17:24,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-13 06:17:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:25,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 06:17:25,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:25,542 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-13 06:17:26,029 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 31 treesize of output 19 [2024-10-13 06:17:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:26,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [578649249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:26,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:17:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-13 06:17:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419781847] [2024-10-13 06:17:26,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:17:26,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:17:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:17:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:17:26,205 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:17:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:26,617 INFO L93 Difference]: Finished difference Result 537 states and 679 transitions. [2024-10-13 06:17:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:17:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 94 [2024-10-13 06:17:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:26,620 INFO L225 Difference]: With dead ends: 537 [2024-10-13 06:17:26,620 INFO L226 Difference]: Without dead ends: 277 [2024-10-13 06:17:26,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2024-10-13 06:17:26,621 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 308 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:26,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 512 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:17:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-13 06:17:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2024-10-13 06:17:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 219 states have (on average 1.2100456621004567) internal successors, (265), 223 states have internal predecessors, (265), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2024-10-13 06:17:26,637 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 94 [2024-10-13 06:17:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:26,637 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2024-10-13 06:17:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:17:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2024-10-13 06:17:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 06:17:26,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:26,638 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:26,646 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 (16)] Ended with exit code 0 [2024-10-13 06:17:26,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-10-13 06:17:27,042 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:27,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1560000385, now seen corresponding path program 1 times [2024-10-13 06:17:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:27,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470199779] [2024-10-13 06:17:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:27,044 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-13 06:17:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:27,046 INFO L229 MonitoredProcess]: Starting monitored process 18 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-13 06:17:27,048 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 (18)] Waiting until timeout for monitored process [2024-10-13 06:17:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:27,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:17:27,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:27,882 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 29 treesize of output 17 [2024-10-13 06:17:27,886 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 18 treesize of output 10 [2024-10-13 06:17:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:27,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:28,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470199779] [2024-10-13 06:17:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470199779] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:28,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:28,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-13 06:17:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003719829] [2024-10-13 06:17:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:28,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:17:28,743 INFO L87 Difference]: Start difference. First operand 261 states and 323 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:30,183 INFO L93 Difference]: Finished difference Result 519 states and 640 transitions. [2024-10-13 06:17:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-13 06:17:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:30,197 INFO L225 Difference]: With dead ends: 519 [2024-10-13 06:17:30,197 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 06:17:30,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:17:30,199 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 40 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:30,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 434 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 06:17:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 06:17:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2024-10-13 06:17:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 219 states have (on average 1.2009132420091324) internal successors, (263), 223 states have internal predecessors, (263), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2024-10-13 06:17:30,237 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 94 [2024-10-13 06:17:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:30,238 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2024-10-13 06:17:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2024-10-13 06:17:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:17:30,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:30,239 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:30,249 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 (18)] Ended with exit code 0 [2024-10-13 06:17:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-13 06:17:30,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1875781786, now seen corresponding path program 1 times [2024-10-13 06:17:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156019869] [2024-10-13 06:17:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:30,442 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-13 06:17:30,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:30,443 INFO L229 MonitoredProcess]: Starting monitored process 19 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-13 06:17:30,444 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 (19)] Waiting until timeout for monitored process [2024-10-13 06:17:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:30,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:17:30,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:17:30,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:30,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156019869] [2024-10-13 06:17:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156019869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:17:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522190807] [2024-10-13 06:17:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:30,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:17:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:17:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:30,765 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:30,835 INFO L93 Difference]: Finished difference Result 517 states and 635 transitions. [2024-10-13 06:17:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2024-10-13 06:17:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:30,838 INFO L225 Difference]: With dead ends: 517 [2024-10-13 06:17:30,838 INFO L226 Difference]: Without dead ends: 261 [2024-10-13 06:17:30,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:17:30,839 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:30,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-13 06:17:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2024-10-13 06:17:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 213 states have (on average 1.187793427230047) internal successors, (253), 217 states have internal predecessors, (253), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 06:17:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 311 transitions. [2024-10-13 06:17:30,884 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 311 transitions. Word has length 95 [2024-10-13 06:17:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 311 transitions. [2024-10-13 06:17:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:17:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 311 transitions. [2024-10-13 06:17:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:17:30,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:30,885 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:30,894 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 (19)] Ended with exit code 0 [2024-10-13 06:17:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-13 06:17:31,086 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash -127056785, now seen corresponding path program 1 times [2024-10-13 06:17:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661927630] [2024-10-13 06:17:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:31,090 INFO L229 MonitoredProcess]: Starting monitored process 20 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-13 06:17:31,091 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 (20)] Waiting until timeout for monitored process [2024-10-13 06:17:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:31,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 06:17:31,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:32,272 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 18 treesize of output 19 [2024-10-13 06:17:32,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:32,708 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 203 treesize of output 133 [2024-10-13 06:17:32,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:32,719 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 288 treesize of output 138 [2024-10-13 06:17:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:32,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:33,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661927630] [2024-10-13 06:17:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661927630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2019510102] [2024-10-13 06:17:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:33,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:17:33,315 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:17:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-10-13 06:17:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:34,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:17:34,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:35,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-10-13 06:17:36,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:17:36,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:36,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2024-10-13 06:17:36,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 142 [2024-10-13 06:17:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:37,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2019510102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:37,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:17:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-10-13 06:17:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553668078] [2024-10-13 06:17:37,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:17:37,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 06:17:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 06:17:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:17:37,171 INFO L87 Difference]: Start difference. First operand 255 states and 311 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 06:17:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:39,564 INFO L93 Difference]: Finished difference Result 737 states and 888 transitions. [2024-10-13 06:17:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:17:39,565 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 95 [2024-10-13 06:17:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:39,568 INFO L225 Difference]: With dead ends: 737 [2024-10-13 06:17:39,568 INFO L226 Difference]: Without dead ends: 735 [2024-10-13 06:17:39,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:17:39,576 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 310 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:39,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 905 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 06:17:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-13 06:17:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 729. [2024-10-13 06:17:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 610 states have (on average 1.1721311475409837) internal successors, (715), 622 states have internal predecessors, (715), 82 states have call successors, (82), 36 states have call predecessors, (82), 36 states have return successors, (82), 70 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:17:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 879 transitions. [2024-10-13 06:17:39,707 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 879 transitions. Word has length 95 [2024-10-13 06:17:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 879 transitions. [2024-10-13 06:17:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 06:17:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 879 transitions. [2024-10-13 06:17:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 06:17:39,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:39,709 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:39,731 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 (20)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:39,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-10-13 06:17:40,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:40,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 303391287, now seen corresponding path program 1 times [2024-10-13 06:17:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191336196] [2024-10-13 06:17:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:40,119 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-13 06:17:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:40,122 INFO L229 MonitoredProcess]: Starting monitored process 22 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-13 06:17:40,123 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 (22)] Waiting until timeout for monitored process [2024-10-13 06:17:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:40,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:17:40,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:40,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:40,791 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 157 treesize of output 67 [2024-10-13 06:17:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:40,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:40,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:40,989 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 101 treesize of output 1 [2024-10-13 06:17:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:17:41,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191336196] [2024-10-13 06:17:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191336196] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2024-10-13 06:17:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124855270] [2024-10-13 06:17:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:41,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:17:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:17:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:17:41,022 INFO L87 Difference]: Start difference. First operand 729 states and 879 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:41,479 INFO L93 Difference]: Finished difference Result 1500 states and 1800 transitions. [2024-10-13 06:17:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:17:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-10-13 06:17:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:41,490 INFO L225 Difference]: With dead ends: 1500 [2024-10-13 06:17:41,490 INFO L226 Difference]: Without dead ends: 765 [2024-10-13 06:17:41,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:17:41,492 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:41,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 388 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:17:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-13 06:17:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 727. [2024-10-13 06:17:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 608 states have (on average 1.169407894736842) internal successors, (711), 620 states have internal predecessors, (711), 82 states have call successors, (82), 36 states have call predecessors, (82), 36 states have return successors, (82), 70 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:17:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 875 transitions. [2024-10-13 06:17:41,636 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 875 transitions. Word has length 97 [2024-10-13 06:17:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:41,636 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 875 transitions. [2024-10-13 06:17:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:17:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 875 transitions. [2024-10-13 06:17:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 06:17:41,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:41,640 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:41,660 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 (22)] Ended with exit code 0 [2024-10-13 06:17:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-13 06:17:41,841 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1147396789, now seen corresponding path program 1 times [2024-10-13 06:17:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818584083] [2024-10-13 06:17:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:41,846 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-13 06:17:41,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:41,848 INFO L229 MonitoredProcess]: Starting monitored process 23 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-13 06:17:41,850 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 (23)] Waiting until timeout for monitored process [2024-10-13 06:17:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:42,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 06:17:42,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:42,921 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 18 treesize of output 19 [2024-10-13 06:17:43,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:43,301 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 203 treesize of output 133 [2024-10-13 06:17:43,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:43,306 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 286 treesize of output 136 [2024-10-13 06:17:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:43,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:43,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818584083] [2024-10-13 06:17:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818584083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124163674] [2024-10-13 06:17:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:17:43,705 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:17:43,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-13 06:17:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:45,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 06:17:45,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:46,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-10-13 06:17:51,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:17:52,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:52,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2024-10-13 06:17:52,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 140 [2024-10-13 06:17:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:17:52,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2124163674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:52,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:17:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2024-10-13 06:17:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48914170] [2024-10-13 06:17:52,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:17:52,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 06:17:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 06:17:52,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=685, Unknown=1, NotChecked=0, Total=812 [2024-10-13 06:17:52,740 INFO L87 Difference]: Start difference. First operand 727 states and 875 transitions. Second operand has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 21 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 06:17:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:56,362 INFO L93 Difference]: Finished difference Result 999 states and 1189 transitions. [2024-10-13 06:17:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 06:17:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 21 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 97 [2024-10-13 06:17:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:56,366 INFO L225 Difference]: With dead ends: 999 [2024-10-13 06:17:56,366 INFO L226 Difference]: Without dead ends: 997 [2024-10-13 06:17:56,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=406, Invalid=1663, Unknown=1, NotChecked=0, Total=2070 [2024-10-13 06:17:56,368 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 296 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:56,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1334 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 06:17:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-13 06:17:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 624. [2024-10-13 06:17:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 535 states have (on average 1.1700934579439253) internal successors, (626), 544 states have internal predecessors, (626), 60 states have call successors, (60), 28 states have call predecessors, (60), 28 states have return successors, (60), 51 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:17:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 746 transitions. [2024-10-13 06:17:56,428 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 746 transitions. Word has length 97 [2024-10-13 06:17:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:56,429 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 746 transitions. [2024-10-13 06:17:56,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 21 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 06:17:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 746 transitions. [2024-10-13 06:17:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:17:56,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:56,430 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:17:56,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:56,640 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 (23)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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-13 06:17:56,831 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1337330665, now seen corresponding path program 1 times [2024-10-13 06:17:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:56,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073254179] [2024-10-13 06:17:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:56,832 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-13 06:17:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:56,836 INFO L229 MonitoredProcess]: Starting monitored process 25 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-13 06:17:56,837 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 (25)] Waiting until timeout for monitored process [2024-10-13 06:17:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:57,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:17:57,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:57,495 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 25 treesize of output 17 [2024-10-13 06:17:57,497 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 27 treesize of output 15 [2024-10-13 06:17:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:17:57,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:57,675 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 34 treesize of output 26 [2024-10-13 06:17:57,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073254179] [2024-10-13 06:17:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073254179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1475388167] [2024-10-13 06:17:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:57,798 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:17:57,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:17:57,801 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:17:57,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-10-13 06:17:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:58,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:17:58,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:59,079 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-13 06:18:00,053 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 25 treesize of output 17 [2024-10-13 06:18:00,056 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 36 treesize of output 20 [2024-10-13 06:18:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:18:00,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:18:00,161 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 34 treesize of output 26 [2024-10-13 06:18:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1475388167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:18:06,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:18:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2024-10-13 06:18:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914312739] [2024-10-13 06:18:06,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:18:06,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 06:18:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:18:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 06:18:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2024-10-13 06:18:06,696 INFO L87 Difference]: Start difference. First operand 624 states and 746 transitions. Second operand has 22 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:18:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:18:15,002 INFO L93 Difference]: Finished difference Result 2077 states and 2475 transitions. [2024-10-13 06:18:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-13 06:18:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 98 [2024-10-13 06:18:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:18:15,008 INFO L225 Difference]: With dead ends: 2077 [2024-10-13 06:18:15,009 INFO L226 Difference]: Without dead ends: 1458 [2024-10-13 06:18:15,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=811, Invalid=4301, Unknown=0, NotChecked=0, Total=5112 [2024-10-13 06:18:15,012 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 714 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:18:15,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1193 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 06:18:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-10-13 06:18:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 636. [2024-10-13 06:18:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 540 states have (on average 1.1481481481481481) internal successors, (620), 548 states have internal predecessors, (620), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 57 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 06:18:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 750 transitions. [2024-10-13 06:18:15,109 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 750 transitions. Word has length 98 [2024-10-13 06:18:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:18:15,110 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 750 transitions. [2024-10-13 06:18:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:18:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 750 transitions. [2024-10-13 06:18:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:18:15,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:18:15,112 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:18:15,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-10-13 06:18:15,325 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 (25)] Forceful destruction successful, exit code 0 [2024-10-13 06:18:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /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-13 06:18:15,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:18:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:18:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2113244060, now seen corresponding path program 1 times [2024-10-13 06:18:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:18:15,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879145360] [2024-10-13 06:18:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:15,514 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-13 06:18:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:18:15,516 INFO L229 MonitoredProcess]: Starting monitored process 27 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-13 06:18:15,517 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 (27)] Waiting until timeout for monitored process [2024-10-13 06:18:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:18:15,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:18:15,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:18:16,356 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 26 treesize of output 18 [2024-10-13 06:18:16,360 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 28 treesize of output 16 [2024-10-13 06:18:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:18:16,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:18:17,013 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 34 treesize of output 26 [2024-10-13 06:18:17,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:18:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879145360] [2024-10-13 06:18:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879145360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:18:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206868298] [2024-10-13 06:18:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:17,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:18:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:18:17,407 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:18:17,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-10-13 06:18:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:18:17,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:18:17,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:18:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:18:18,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:18:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [206868298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:18:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:18:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-13 06:18:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098132488] [2024-10-13 06:18:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:18:18,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:18:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:18:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:18:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:18:18,070 INFO L87 Difference]: Start difference. First operand 636 states and 750 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:18:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:18:18,372 INFO L93 Difference]: Finished difference Result 1352 states and 1593 transitions. [2024-10-13 06:18:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:18:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:18:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:18:18,376 INFO L225 Difference]: With dead ends: 1352 [2024-10-13 06:18:18,377 INFO L226 Difference]: Without dead ends: 762 [2024-10-13 06:18:18,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:18:18,379 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:18:18,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 355 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:18:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-13 06:18:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 718. [2024-10-13 06:18:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 622 states have (on average 1.1366559485530547) internal successors, (707), 630 states have internal predecessors, (707), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 57 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 06:18:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 837 transitions. [2024-10-13 06:18:18,464 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 837 transitions. Word has length 98 [2024-10-13 06:18:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:18:18,465 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 837 transitions. [2024-10-13 06:18:18,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:18:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 837 transitions. [2024-10-13 06:18:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:18:18,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:18:18,467 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:18:18,479 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 (27)] Forceful destruction successful, exit code 0 [2024-10-13 06:18:18,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-10-13 06:18:18,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:18:18,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:18:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:18:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 338236698, now seen corresponding path program 1 times [2024-10-13 06:18:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:18:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136664698] [2024-10-13 06:18:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:18,869 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-13 06:18:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:18:18,871 INFO L229 MonitoredProcess]: Starting monitored process 29 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-13 06:18:18,873 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 (29)] Waiting until timeout for monitored process [2024-10-13 06:18:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:18:19,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:18:19,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:18:19,788 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 26 treesize of output 18 [2024-10-13 06:18:19,793 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 28 treesize of output 16 [2024-10-13 06:18:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:18:19,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:18:20,200 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 34 treesize of output 26 [2024-10-13 06:18:20,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:18:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136664698] [2024-10-13 06:18:20,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136664698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:18:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [600024612] [2024-10-13 06:18:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:18:20,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:18:20,376 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:18:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-10-13 06:18:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:18:21,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 06:18:21,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:18:21,604 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-13 06:18:22,870 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 26 treesize of output 18 [2024-10-13 06:18:22,876 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 28 treesize of output 16 [2024-10-13 06:18:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 06:18:22,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:18:23,075 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 34 treesize of output 26 [2024-10-13 06:18:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [600024612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:18:26,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:18:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-13 06:18:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283925182] [2024-10-13 06:18:26,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:18:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 06:18:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:18:26,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 06:18:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:18:26,756 INFO L87 Difference]: Start difference. First operand 718 states and 837 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:18:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:18:28,807 INFO L93 Difference]: Finished difference Result 1466 states and 1701 transitions. [2024-10-13 06:18:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:18:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 98 [2024-10-13 06:18:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:18:28,811 INFO L225 Difference]: With dead ends: 1466 [2024-10-13 06:18:28,811 INFO L226 Difference]: Without dead ends: 794 [2024-10-13 06:18:28,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 06:18:28,814 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 230 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:18:28,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 631 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 06:18:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-13 06:18:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 692. [2024-10-13 06:18:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 596 states have (on average 1.1308724832214765) internal successors, (674), 604 states have internal predecessors, (674), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 57 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 06:18:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 804 transitions. [2024-10-13 06:18:28,885 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 804 transitions. Word has length 98 [2024-10-13 06:18:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:18:28,885 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 804 transitions. [2024-10-13 06:18:28,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-13 06:18:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 804 transitions. [2024-10-13 06:18:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:18:28,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:18:28,886 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:18:28,901 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 (29)] Forceful destruction successful, exit code 0 [2024-10-13 06:18:29,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-10-13 06:18:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:18:29,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:18:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:18:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1867554484, now seen corresponding path program 1 times [2024-10-13 06:18:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:18:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388843373] [2024-10-13 06:18:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:29,292 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-13 06:18:29,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:18:29,294 INFO L229 MonitoredProcess]: Starting monitored process 31 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-13 06:18:29,296 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 (31)] Waiting until timeout for monitored process [2024-10-13 06:18:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:18:29,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:18:29,721 INFO L278 TraceCheckSpWp]: Computing forward predicates...