./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:10:19,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:10:19,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 07:10:19,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:10:19,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:10:19,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:10:19,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:10:19,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:10:19,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:10:19,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:10:19,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:10:19,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:10:19,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:10:19,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:10:19,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:10:19,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:10:19,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:10:19,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 07:10:19,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:10:19,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:10:19,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:10:19,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:10:19,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:10:19,474 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:10:19,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:10:19,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:10:19,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:10:19,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:10:19,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:10:19,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:10:19,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:10:19,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:10:19,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:10:19,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:10:19,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:10:19,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 07:10:19,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 07:10:19,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:10:19,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:10:19,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:10:19,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:10:19,481 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-17 07:10:19,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:10:19,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:10:19,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:10:19,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:10:19,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:10:19,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-17 07:10:21,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:10:21,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:10:21,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-17 07:10:21,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75e57110/2bb000e8e0f14243a6dc50a17b542792/FLAG7a8318d95 [2024-11-17 07:10:21,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75e57110/2bb000e8e0f14243a6dc50a17b542792 [2024-11-17 07:10:21,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:10:21,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:10:21,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:10:21,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:10:21,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:10:21,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:10:21" (1/1) ... [2024-11-17 07:10:21,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a93cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:21, skipping insertion in model container [2024-11-17 07:10:21,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:10:21" (1/1) ... [2024-11-17 07:10:21,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:10:22,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:10:22,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:10:22,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:10:22,446 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:10:22,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22 WrapperNode [2024-11-17 07:10:22,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:10:22,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:10:22,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:10:22,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:10:22,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,542 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 735 [2024-11-17 07:10:22,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:10:22,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:10:22,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:10:22,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:10:22,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,608 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 12, 3, 3, 12, 2, 3, 4, 4, 4, 3, 3, 355, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 3, 3, 0, 0, 3, 3, 3, 3, 3, 1, 355, 0]. The 11 writes are split as follows [0, 5, 0, 0, 2, 1, 0, 0, 0, 0, 0, 1, 0, 2]. [2024-11-17 07:10:22,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:10:22,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:10:22,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:10:22,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:10:22,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (1/1) ... [2024-11-17 07:10:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:10:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:22,709 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-11-17 07:10:22,712 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-11-17 07:10:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 07:10:22,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 07:10:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 07:10:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-17 07:10:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-17 07:10:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 07:10:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 07:10:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 07:10:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 07:10:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-17 07:10:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-17 07:10:22,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-17 07:10:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-17 07:10:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-17 07:10:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-17 07:10:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-17 07:10:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 07:10:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 07:10:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 07:10:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 07:10:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-17 07:10:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-17 07:10:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-17 07:10:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-17 07:10:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:10:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:10:23,137 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:10:23,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:10:23,738 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-17 07:10:23,739 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:10:23,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:10:23,753 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:10:23,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:10:23 BoogieIcfgContainer [2024-11-17 07:10:23,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:10:23,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:10:23,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:10:23,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:10:23,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:10:21" (1/3) ... [2024-11-17 07:10:23,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f539a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:10:23, skipping insertion in model container [2024-11-17 07:10:23,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:10:22" (2/3) ... [2024-11-17 07:10:23,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f539a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:10:23, skipping insertion in model container [2024-11-17 07:10:23,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:10:23" (3/3) ... [2024-11-17 07:10:23,764 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-17 07:10:23,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:10:23,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-17 07:10:23,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:10:23,862 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;@3e5f3933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:10:23,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-17 07:10:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 111 states have (on average 1.6036036036036037) internal successors, (178), 135 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 07:10:23,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:23,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 07:10:23,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:23,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash 230909005, now seen corresponding path program 1 times [2024-11-17 07:10:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147352982] [2024-11-17 07:10:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147352982] [2024-11-17 07:10:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147352982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:24,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:24,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:10:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502830541] [2024-11-17 07:10:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:24,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:24,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:24,527 INFO L87 Difference]: Start difference. First operand has 139 states, 111 states have (on average 1.6036036036036037) internal successors, (178), 135 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:24,601 INFO L93 Difference]: Finished difference Result 274 states and 362 transitions. [2024-11-17 07:10:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:24,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 07:10:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:24,613 INFO L225 Difference]: With dead ends: 274 [2024-11-17 07:10:24,613 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 07:10:24,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:24,621 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:24,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 322 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 07:10:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-17 07:10:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 132 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2024-11-17 07:10:24,675 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 5 [2024-11-17 07:10:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:24,676 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2024-11-17 07:10:24,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2024-11-17 07:10:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 07:10:24,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:24,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:24,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 07:10:24,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:24,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1171911746, now seen corresponding path program 1 times [2024-11-17 07:10:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663802635] [2024-11-17 07:10:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:25,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663802635] [2024-11-17 07:10:25,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663802635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:25,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036713388] [2024-11-17 07:10:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:25,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:25,014 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-11-17 07:10:25,016 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-11-17 07:10:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:25,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:25,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:25,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:25,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036713388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:25,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:25,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 07:10:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238016939] [2024-11-17 07:10:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:25,405 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:25,447 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2024-11-17 07:10:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 07:10:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:25,450 INFO L225 Difference]: With dead ends: 137 [2024-11-17 07:10:25,452 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 07:10:25,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:25,453 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:25,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 311 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 07:10:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2024-11-17 07:10:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 131 states have internal predecessors, (162), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2024-11-17 07:10:25,470 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 10 [2024-11-17 07:10:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:25,471 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2024-11-17 07:10:25,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2024-11-17 07:10:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 07:10:25,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:25,472 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-17 07:10:25,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 07:10:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:25,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:25,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1969525929, now seen corresponding path program 1 times [2024-11-17 07:10:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539473545] [2024-11-17 07:10:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 07:10:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539473545] [2024-11-17 07:10:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539473545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:25,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:25,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:10:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467139826] [2024-11-17 07:10:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:25,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:25,854 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:25,879 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2024-11-17 07:10:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 07:10:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:25,881 INFO L225 Difference]: With dead ends: 135 [2024-11-17 07:10:25,883 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 07:10:25,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:25,884 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:25,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 311 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 07:10:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-17 07:10:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.485981308411215) internal successors, (159), 128 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2024-11-17 07:10:25,897 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 11 [2024-11-17 07:10:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:25,897 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2024-11-17 07:10:25,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:10:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2024-11-17 07:10:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 07:10:25,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:25,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:25,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 07:10:25,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:25,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1801472151, now seen corresponding path program 1 times [2024-11-17 07:10:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530929005] [2024-11-17 07:10:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 07:10:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530929005] [2024-11-17 07:10:26,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530929005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:26,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498343531] [2024-11-17 07:10:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:26,148 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-11-17 07:10:26,149 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-11-17 07:10:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:26,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:10:26,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 07:10:26,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498343531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-17 07:10:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946465874] [2024-11-17 07:10:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:26,476 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:26,521 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2024-11-17 07:10:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-17 07:10:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:26,523 INFO L225 Difference]: With dead ends: 132 [2024-11-17 07:10:26,523 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 07:10:26,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:26,524 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 141 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:26,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 159 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 07:10:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 07:10:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 126 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-17 07:10:26,539 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 16 [2024-11-17 07:10:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-17 07:10:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-17 07:10:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 07:10:26,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:26,542 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:26,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 07:10:26,742 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,SelfDestructingSolverStorable3 [2024-11-17 07:10:26,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:26,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 11061997, now seen corresponding path program 1 times [2024-11-17 07:10:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775746900] [2024-11-17 07:10:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 07:10:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775746900] [2024-11-17 07:10:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775746900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804618017] [2024-11-17 07:10:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:26,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:26,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 07:10:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:27,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:27,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:27,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804618017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:27,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 07:10:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826870968] [2024-11-17 07:10:27,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:27,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:10:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:10:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:27,260 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:27,305 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2024-11-17 07:10:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-17 07:10:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:27,307 INFO L225 Difference]: With dead ends: 266 [2024-11-17 07:10:27,307 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 07:10:27,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:27,310 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 6 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:27,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 612 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 07:10:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-17 07:10:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.4098360655737705) internal successors, (172), 141 states have internal predecessors, (172), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2024-11-17 07:10:27,328 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 17 [2024-11-17 07:10:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:27,328 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2024-11-17 07:10:27,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2024-11-17 07:10:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 07:10:27,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:27,329 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:27,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:27,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:27,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 688244290, now seen corresponding path program 2 times [2024-11-17 07:10:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673928452] [2024-11-17 07:10:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 07:10:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673928452] [2024-11-17 07:10:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673928452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824245075] [2024-11-17 07:10:27,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:10:27,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:27,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:27,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 07:10:28,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:10:28,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:10:28,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 07:10:28,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 07:10:28,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824245075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-17 07:10:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700656466] [2024-11-17 07:10:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:28,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:10:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:10:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:10:28,165 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:28,221 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2024-11-17 07:10:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:10:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-17 07:10:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:28,223 INFO L225 Difference]: With dead ends: 145 [2024-11-17 07:10:28,224 INFO L226 Difference]: Without dead ends: 143 [2024-11-17 07:10:28,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:10:28,225 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 436 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:28,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 436 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-17 07:10:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-17 07:10:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 139 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2024-11-17 07:10:28,236 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 32 [2024-11-17 07:10:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:28,237 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2024-11-17 07:10:28,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2024-11-17 07:10:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 07:10:28,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:28,238 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:28,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 07:10:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:28,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1565288653, now seen corresponding path program 1 times [2024-11-17 07:10:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842058857] [2024-11-17 07:10:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 07:10:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 07:10:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842058857] [2024-11-17 07:10:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842058857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:10:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367056489] [2024-11-17 07:10:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:28,693 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:28,727 INFO L93 Difference]: Finished difference Result 259 states and 322 transitions. [2024-11-17 07:10:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-17 07:10:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:28,729 INFO L225 Difference]: With dead ends: 259 [2024-11-17 07:10:28,729 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 07:10:28,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:28,730 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:28,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 07:10:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-17 07:10:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.380952380952381) internal successors, (174), 143 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2024-11-17 07:10:28,736 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 41 [2024-11-17 07:10:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2024-11-17 07:10:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2024-11-17 07:10:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 07:10:28,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:28,738 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 07:10:28,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 674020104, now seen corresponding path program 1 times [2024-11-17 07:10:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184984803] [2024-11-17 07:10:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 07:10:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184984803] [2024-11-17 07:10:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184984803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546186808] [2024-11-17 07:10:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:29,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:29,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 07:10:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:29,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 07:10:29,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:29,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:10:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546186808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:29,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 07:10:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479804909] [2024-11-17 07:10:29,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 07:10:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 07:10:29,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 07:10:29,506 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:29,581 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2024-11-17 07:10:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:10:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-17 07:10:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:29,584 INFO L225 Difference]: With dead ends: 300 [2024-11-17 07:10:29,584 INFO L226 Difference]: Without dead ends: 177 [2024-11-17 07:10:29,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 07:10:29,585 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 6 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:29,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 760 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-17 07:10:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-17 07:10:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 173 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 208 transitions. [2024-11-17 07:10:29,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 208 transitions. Word has length 45 [2024-11-17 07:10:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 208 transitions. [2024-11-17 07:10:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2024-11-17 07:10:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 07:10:29,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:29,594 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:29,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:29,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:29,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1257425304, now seen corresponding path program 2 times [2024-11-17 07:10:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904180363] [2024-11-17 07:10:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:30,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904180363] [2024-11-17 07:10:30,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904180363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:30,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:10:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359901012] [2024-11-17 07:10:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:30,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:30,078 INFO L87 Difference]: Start difference. First operand 177 states and 208 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:30,087 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2024-11-17 07:10:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-17 07:10:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:30,089 INFO L225 Difference]: With dead ends: 240 [2024-11-17 07:10:30,089 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 07:10:30,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:30,090 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 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-11-17 07:10:30,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 07:10:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-17 07:10:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 146 states have internal predecessors, (171), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2024-11-17 07:10:30,099 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 75 [2024-11-17 07:10:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2024-11-17 07:10:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2024-11-17 07:10:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 07:10:30,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:30,105 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 07:10:30,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1283872599, now seen corresponding path program 1 times [2024-11-17 07:10:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635176112] [2024-11-17 07:10:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635176112] [2024-11-17 07:10:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635176112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:30,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:30,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:10:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078953207] [2024-11-17 07:10:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:30,306 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:30,325 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2024-11-17 07:10:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-17 07:10:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:30,326 INFO L225 Difference]: With dead ends: 157 [2024-11-17 07:10:30,326 INFO L226 Difference]: Without dead ends: 155 [2024-11-17 07:10:30,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:30,327 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:30,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 236 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-17 07:10:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-17 07:10:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 150 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2024-11-17 07:10:30,333 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 75 [2024-11-17 07:10:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:30,333 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2024-11-17 07:10:30,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2024-11-17 07:10:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 07:10:30,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:30,335 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:30,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 07:10:30,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:30,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 792479967, now seen corresponding path program 1 times [2024-11-17 07:10:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118975470] [2024-11-17 07:10:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:30,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118975470] [2024-11-17 07:10:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118975470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015768524] [2024-11-17 07:10:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:30,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:30,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 07:10:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:30,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:30,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:30,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015768524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 07:10:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834798516] [2024-11-17 07:10:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:30,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:30,946 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:30,974 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2024-11-17 07:10:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2024-11-17 07:10:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:30,976 INFO L225 Difference]: With dead ends: 155 [2024-11-17 07:10:30,976 INFO L226 Difference]: Without dead ends: 154 [2024-11-17 07:10:30,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:30,977 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:30,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-17 07:10:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-17 07:10:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 149 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2024-11-17 07:10:30,982 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 76 [2024-11-17 07:10:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2024-11-17 07:10:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2024-11-17 07:10:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 07:10:30,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:30,984 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:31,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 07:10:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:31,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1499908126, now seen corresponding path program 1 times [2024-11-17 07:10:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953087503] [2024-11-17 07:10:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953087503] [2024-11-17 07:10:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953087503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 07:10:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126334836] [2024-11-17 07:10:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:10:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:10:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:10:31,684 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:31,762 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2024-11-17 07:10:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-17 07:10:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:31,763 INFO L225 Difference]: With dead ends: 244 [2024-11-17 07:10:31,763 INFO L226 Difference]: Without dead ends: 169 [2024-11-17 07:10:31,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:10:31,764 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 124 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:31,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-17 07:10:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-17 07:10:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 163 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-17 07:10:31,770 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 77 [2024-11-17 07:10:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:31,771 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-17 07:10:31,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-17 07:10:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 07:10:31,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:31,772 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:31,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 07:10:31,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1202924657, now seen corresponding path program 1 times [2024-11-17 07:10:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620416760] [2024-11-17 07:10:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-17 07:10:31,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:31,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620416760] [2024-11-17 07:10:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620416760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:31,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:31,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:10:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159135425] [2024-11-17 07:10:31,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:31,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:10:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:10:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:31,918 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:31,933 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2024-11-17 07:10:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:10:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-17 07:10:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:31,935 INFO L225 Difference]: With dead ends: 167 [2024-11-17 07:10:31,935 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 07:10:31,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:10:31,935 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:31,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 07:10:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2024-11-17 07:10:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 151 states have (on average 1.218543046357616) internal successors, (184), 158 states have internal predecessors, (184), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2024-11-17 07:10:31,941 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 77 [2024-11-17 07:10:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:31,941 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2024-11-17 07:10:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2024-11-17 07:10:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 07:10:31,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:31,942 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:31,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 07:10:31,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -777346283, now seen corresponding path program 1 times [2024-11-17 07:10:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726143192] [2024-11-17 07:10:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726143192] [2024-11-17 07:10:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726143192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686139681] [2024-11-17 07:10:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:32,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 07:10:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:32,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:32,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:32,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:32,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686139681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:32,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 07:10:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016081809] [2024-11-17 07:10:32,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:32,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:10:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:10:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:32,592 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:32,627 INFO L93 Difference]: Finished difference Result 283 states and 338 transitions. [2024-11-17 07:10:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-17 07:10:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:32,628 INFO L225 Difference]: With dead ends: 283 [2024-11-17 07:10:32,628 INFO L226 Difference]: Without dead ends: 192 [2024-11-17 07:10:32,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:32,629 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:32,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 348 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-17 07:10:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-17 07:10:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.1823204419889504) internal successors, (214), 188 states have internal predecessors, (214), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 218 transitions. [2024-11-17 07:10:32,636 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 218 transitions. Word has length 90 [2024-11-17 07:10:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:32,636 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 218 transitions. [2024-11-17 07:10:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2024-11-17 07:10:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 07:10:32,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:32,637 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:32,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 07:10:32,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:32,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1404661559, now seen corresponding path program 2 times [2024-11-17 07:10:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992202788] [2024-11-17 07:10:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992202788] [2024-11-17 07:10:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992202788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505603581] [2024-11-17 07:10:33,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:10:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:33,170 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:33,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 07:10:33,527 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:10:33,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:10:33,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 07:10:33,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-17 07:10:33,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505603581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-17 07:10:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151755592] [2024-11-17 07:10:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:33,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:10:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:10:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-17 07:10:33,712 INFO L87 Difference]: Start difference. First operand 192 states and 218 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:33,802 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2024-11-17 07:10:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-17 07:10:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:33,803 INFO L225 Difference]: With dead ends: 194 [2024-11-17 07:10:33,803 INFO L226 Difference]: Without dead ends: 193 [2024-11-17 07:10:33,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-17 07:10:33,804 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 94 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:33,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 402 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-17 07:10:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-17 07:10:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 181 states have (on average 1.1767955801104972) internal successors, (213), 187 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2024-11-17 07:10:33,813 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 105 [2024-11-17 07:10:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:33,813 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2024-11-17 07:10:33,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2024-11-17 07:10:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 07:10:33,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:33,815 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:33,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:34,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 07:10:34,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -594835289, now seen corresponding path program 1 times [2024-11-17 07:10:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104606642] [2024-11-17 07:10:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104606642] [2024-11-17 07:10:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104606642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382954070] [2024-11-17 07:10:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:34,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:34,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:34,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:34,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 07:10:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:34,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 07:10:34,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:34,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:10:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382954070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:34,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:34,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 07:10:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118234674] [2024-11-17 07:10:34,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 07:10:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 07:10:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 07:10:34,861 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:34,968 INFO L93 Difference]: Finished difference Result 356 states and 417 transitions. [2024-11-17 07:10:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:10:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-17 07:10:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:34,970 INFO L225 Difference]: With dead ends: 356 [2024-11-17 07:10:34,970 INFO L226 Difference]: Without dead ends: 251 [2024-11-17 07:10:34,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 07:10:34,971 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:34,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 687 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-17 07:10:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-17 07:10:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1327800829875518) internal successors, (273), 247 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2024-11-17 07:10:34,983 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 106 [2024-11-17 07:10:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:34,984 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2024-11-17 07:10:34,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2024-11-17 07:10:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-17 07:10:34,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:34,986 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:35,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 07:10:35,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 07:10:35,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:35,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 439413287, now seen corresponding path program 2 times [2024-11-17 07:10:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689551101] [2024-11-17 07:10:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:35,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-17 07:10:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689551101] [2024-11-17 07:10:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689551101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821605210] [2024-11-17 07:10:35,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:10:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:35,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:35,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 07:10:36,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:10:36,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:10:36,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:10:36,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:36,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821605210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-17 07:10:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064188493] [2024-11-17 07:10:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:36,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:10:36,213 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:36,261 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2024-11-17 07:10:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2024-11-17 07:10:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:36,263 INFO L225 Difference]: With dead ends: 251 [2024-11-17 07:10:36,263 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 07:10:36,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 07:10:36,264 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 91 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:36,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 216 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 07:10:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-17 07:10:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 241 states have (on average 1.1286307053941909) internal successors, (272), 246 states have internal predecessors, (272), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2024-11-17 07:10:36,273 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 136 [2024-11-17 07:10:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:36,273 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2024-11-17 07:10:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2024-11-17 07:10:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-17 07:10:36,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:36,275 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:36,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:36,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 07:10:36,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1860260894, now seen corresponding path program 1 times [2024-11-17 07:10:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115823517] [2024-11-17 07:10:36,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115823517] [2024-11-17 07:10:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115823517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131742057] [2024-11-17 07:10:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:36,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:36,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:36,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 07:10:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:37,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:37,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:37,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131742057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:37,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 07:10:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943868906] [2024-11-17 07:10:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:37,235 INFO L87 Difference]: Start difference. First operand 250 states and 276 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:37,283 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2024-11-17 07:10:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2024-11-17 07:10:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:37,285 INFO L225 Difference]: With dead ends: 251 [2024-11-17 07:10:37,285 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 07:10:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:37,286 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:37,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 227 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 07:10:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2024-11-17 07:10:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 241 states have (on average 1.1244813278008299) internal successors, (271), 245 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2024-11-17 07:10:37,295 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 138 [2024-11-17 07:10:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:37,296 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2024-11-17 07:10:37,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2024-11-17 07:10:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-17 07:10:37,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:37,297 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:37,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-17 07:10:37,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 07:10:37,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1833512844, now seen corresponding path program 1 times [2024-11-17 07:10:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691699856] [2024-11-17 07:10:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691699856] [2024-11-17 07:10:37,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691699856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504316736] [2024-11-17 07:10:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:37,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:37,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 07:10:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:38,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:38,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:38,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-17 07:10:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504316736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:38,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-17 07:10:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980729572] [2024-11-17 07:10:38,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:10:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:10:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:38,271 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:38,316 INFO L93 Difference]: Finished difference Result 265 states and 293 transitions. [2024-11-17 07:10:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2024-11-17 07:10:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:38,318 INFO L225 Difference]: With dead ends: 265 [2024-11-17 07:10:38,318 INFO L226 Difference]: Without dead ends: 264 [2024-11-17 07:10:38,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:38,319 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:38,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 564 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-17 07:10:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-17 07:10:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 256 states have (on average 1.1171875) internal successors, (286), 260 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 290 transitions. [2024-11-17 07:10:38,329 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 290 transitions. Word has length 139 [2024-11-17 07:10:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 290 transitions. [2024-11-17 07:10:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 290 transitions. [2024-11-17 07:10:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-17 07:10:38,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:38,331 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:38,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-17 07:10:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:38,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash 565197466, now seen corresponding path program 2 times [2024-11-17 07:10:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722227454] [2024-11-17 07:10:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-17 07:10:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722227454] [2024-11-17 07:10:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722227454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091622890] [2024-11-17 07:10:38,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:10:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:38,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:38,835 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:38,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 07:10:39,218 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:10:39,218 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:10:39,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:39,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-17 07:10:39,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-17 07:10:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091622890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:39,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:39,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-17 07:10:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762530746] [2024-11-17 07:10:39,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:39,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:10:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:10:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:10:39,476 INFO L87 Difference]: Start difference. First operand 264 states and 290 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:39,538 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2024-11-17 07:10:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:10:39,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2024-11-17 07:10:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:39,541 INFO L225 Difference]: With dead ends: 264 [2024-11-17 07:10:39,541 INFO L226 Difference]: Without dead ends: 235 [2024-11-17 07:10:39,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:10:39,542 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 152 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:39,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 322 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-17 07:10:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-17 07:10:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 228 states have (on average 1.1096491228070176) internal successors, (253), 231 states have internal predecessors, (253), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2024-11-17 07:10:39,555 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 154 [2024-11-17 07:10:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:39,556 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2024-11-17 07:10:39,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2024-11-17 07:10:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-17 07:10:39,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:39,559 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:39,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:39,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-17 07:10:39,760 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:39,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1586236736, now seen corresponding path program 1 times [2024-11-17 07:10:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:39,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072728249] [2024-11-17 07:10:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-17 07:10:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-17 07:10:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072728249] [2024-11-17 07:10:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072728249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:10:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348130614] [2024-11-17 07:10:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:40,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:40,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:10:40,035 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:40,058 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2024-11-17 07:10:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:40,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 158 [2024-11-17 07:10:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:40,060 INFO L225 Difference]: With dead ends: 250 [2024-11-17 07:10:40,060 INFO L226 Difference]: Without dead ends: 249 [2024-11-17 07:10:40,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:10:40,061 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:40,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-17 07:10:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2024-11-17 07:10:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 239 states have (on average 1.112970711297071) internal successors, (266), 242 states have internal predecessors, (266), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2024-11-17 07:10:40,069 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 158 [2024-11-17 07:10:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:40,069 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2024-11-17 07:10:40,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2024-11-17 07:10:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 07:10:40,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:40,071 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:40,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 07:10:40,072 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1928698566, now seen corresponding path program 1 times [2024-11-17 07:10:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569251122] [2024-11-17 07:10:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-17 07:10:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-17 07:10:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569251122] [2024-11-17 07:10:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569251122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:10:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370549130] [2024-11-17 07:10:40,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:10:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:10:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:40,417 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:40,448 INFO L93 Difference]: Finished difference Result 284 states and 315 transitions. [2024-11-17 07:10:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:10:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 159 [2024-11-17 07:10:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:40,451 INFO L225 Difference]: With dead ends: 284 [2024-11-17 07:10:40,451 INFO L226 Difference]: Without dead ends: 257 [2024-11-17 07:10:40,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:40,453 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:40,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 416 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-17 07:10:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2024-11-17 07:10:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 241 states have (on average 1.112033195020747) internal successors, (268), 244 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2024-11-17 07:10:40,463 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 159 [2024-11-17 07:10:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:40,464 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2024-11-17 07:10:40,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:10:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2024-11-17 07:10:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 07:10:40,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:40,466 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:40,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 07:10:40,467 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1041194885, now seen corresponding path program 1 times [2024-11-17 07:10:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:40,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485952541] [2024-11-17 07:10:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-17 07:10:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-17 07:10:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485952541] [2024-11-17 07:10:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485952541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 07:10:40,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542633397] [2024-11-17 07:10:40,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:40,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 07:10:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 07:10:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:10:40,871 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:40,949 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions. [2024-11-17 07:10:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 07:10:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 159 [2024-11-17 07:10:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:40,950 INFO L225 Difference]: With dead ends: 256 [2024-11-17 07:10:40,950 INFO L226 Difference]: Without dead ends: 255 [2024-11-17 07:10:40,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:10:40,951 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:40,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 396 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-17 07:10:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 250. [2024-11-17 07:10:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 242 states have (on average 1.1115702479338843) internal successors, (269), 245 states have internal predecessors, (269), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2024-11-17 07:10:40,961 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 159 [2024-11-17 07:10:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:40,962 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2024-11-17 07:10:40,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2024-11-17 07:10:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-17 07:10:40,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:40,965 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:40,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 07:10:40,965 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1192140953, now seen corresponding path program 1 times [2024-11-17 07:10:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151981924] [2024-11-17 07:10:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-17 07:10:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-17 07:10:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-11-17 07:10:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151981924] [2024-11-17 07:10:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151981924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766516512] [2024-11-17 07:10:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:41,312 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:41,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 07:10:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:41,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 07:10:41,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-17 07:10:41,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766516512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-17 07:10:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117615843] [2024-11-17 07:10:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:41,922 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:41,939 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2024-11-17 07:10:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 176 [2024-11-17 07:10:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:41,941 INFO L225 Difference]: With dead ends: 250 [2024-11-17 07:10:41,941 INFO L226 Difference]: Without dead ends: 249 [2024-11-17 07:10:41,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:10:41,942 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:41,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-17 07:10:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-17 07:10:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 242 states have (on average 1.1074380165289257) internal successors, (268), 244 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2024-11-17 07:10:41,964 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 176 [2024-11-17 07:10:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:41,965 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2024-11-17 07:10:41,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2024-11-17 07:10:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-17 07:10:41,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:41,966 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:41,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-17 07:10:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:42,167 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1698336115, now seen corresponding path program 1 times [2024-11-17 07:10:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806232821] [2024-11-17 07:10:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-17 07:10:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-17 07:10:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-17 07:10:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806232821] [2024-11-17 07:10:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806232821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707271104] [2024-11-17 07:10:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:42,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:42,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:42,863 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:42,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 07:10:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:43,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 1713 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 07:10:43,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-11-17 07:10:43,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-17 07:10:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707271104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:44,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-17 07:10:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903216991] [2024-11-17 07:10:44,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 07:10:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 07:10:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-17 07:10:44,120 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:44,288 INFO L93 Difference]: Finished difference Result 381 states and 429 transitions. [2024-11-17 07:10:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 07:10:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 177 [2024-11-17 07:10:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:44,290 INFO L225 Difference]: With dead ends: 381 [2024-11-17 07:10:44,290 INFO L226 Difference]: Without dead ends: 308 [2024-11-17 07:10:44,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-17 07:10:44,291 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 71 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:44,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 815 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-17 07:10:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2024-11-17 07:10:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 300 states have (on average 1.0933333333333333) internal successors, (328), 302 states have internal predecessors, (328), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 334 transitions. [2024-11-17 07:10:44,306 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 334 transitions. Word has length 177 [2024-11-17 07:10:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:44,306 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 334 transitions. [2024-11-17 07:10:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 334 transitions. [2024-11-17 07:10:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-17 07:10:44,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:44,308 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:44,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:44,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:44,509 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1612594898, now seen corresponding path program 1 times [2024-11-17 07:10:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:44,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737212173] [2024-11-17 07:10:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-17 07:10:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737212173] [2024-11-17 07:10:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737212173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733153231] [2024-11-17 07:10:44,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:44,916 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:44,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 07:10:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:45,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:10:45,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-17 07:10:45,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:10:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733153231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:10:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 07:10:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637903940] [2024-11-17 07:10:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:45,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:10:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:10:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:45,658 INFO L87 Difference]: Start difference. First operand 307 states and 334 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:45,699 INFO L93 Difference]: Finished difference Result 307 states and 334 transitions. [2024-11-17 07:10:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:10:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2024-11-17 07:10:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:45,701 INFO L225 Difference]: With dead ends: 307 [2024-11-17 07:10:45,701 INFO L226 Difference]: Without dead ends: 306 [2024-11-17 07:10:45,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:45,702 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:45,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-17 07:10:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-17 07:10:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.0866666666666667) internal successors, (326), 301 states have internal predecessors, (326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2024-11-17 07:10:45,711 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 180 [2024-11-17 07:10:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2024-11-17 07:10:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2024-11-17 07:10:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-17 07:10:45,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:45,714 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:45,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-17 07:10:45,915 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1728853338, now seen corresponding path program 2 times [2024-11-17 07:10:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889505654] [2024-11-17 07:10:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-17 07:10:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-17 07:10:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-17 07:10:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889505654] [2024-11-17 07:10:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889505654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532554568] [2024-11-17 07:10:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:10:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:47,803 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-17 07:10:48,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 07:10:48,481 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:10:48,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 2010 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 07:10:48,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:48,598 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 1 [2024-11-17 07:10:48,699 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 20 treesize of output 8 [2024-11-17 07:10:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2024-11-17 07:10:48,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:48,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-17 07:10:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-17 07:10:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-17 07:10:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532554568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:48,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-17 07:10:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408180804] [2024-11-17 07:10:48,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:48,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 07:10:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:48,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 07:10:48,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-17 07:10:48,893 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:49,005 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2024-11-17 07:10:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:10:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 235 [2024-11-17 07:10:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:49,011 INFO L225 Difference]: With dead ends: 365 [2024-11-17 07:10:49,011 INFO L226 Difference]: Without dead ends: 307 [2024-11-17 07:10:49,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-17 07:10:49,011 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 23 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:49,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 665 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-17 07:10:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2024-11-17 07:10:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.0833333333333333) internal successors, (325), 301 states have internal predecessors, (325), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 331 transitions. [2024-11-17 07:10:49,028 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 331 transitions. Word has length 235 [2024-11-17 07:10:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:49,028 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 331 transitions. [2024-11-17 07:10:49,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 331 transitions. [2024-11-17 07:10:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-17 07:10:49,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:49,030 INFO L215 NwaCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:49,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 07:10:49,231 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1828259747, now seen corresponding path program 1 times [2024-11-17 07:10:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988928007] [2024-11-17 07:10:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 1090 refuted. 0 times theorem prover too weak. 1532 trivial. 0 not checked. [2024-11-17 07:10:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988928007] [2024-11-17 07:10:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988928007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28261909] [2024-11-17 07:10:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:49,853 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:49,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-17 07:10:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:50,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:10:50,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 1642 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-17 07:10:50,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 1642 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-17 07:10:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28261909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:50,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:50,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2024-11-17 07:10:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003672418] [2024-11-17 07:10:50,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 07:10:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 07:10:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-17 07:10:50,964 INFO L87 Difference]: Start difference. First operand 306 states and 331 transitions. Second operand has 9 states, 8 states have (on average 13.5) internal successors, (108), 9 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:51,084 INFO L93 Difference]: Finished difference Result 425 states and 457 transitions. [2024-11-17 07:10:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 07:10:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.5) internal successors, (108), 9 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 239 [2024-11-17 07:10:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:51,086 INFO L225 Difference]: With dead ends: 425 [2024-11-17 07:10:51,086 INFO L226 Difference]: Without dead ends: 424 [2024-11-17 07:10:51,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2024-11-17 07:10:51,087 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 71 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:51,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 378 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:10:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-17 07:10:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 250. [2024-11-17 07:10:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.0938775510204082) internal successors, (268), 245 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2024-11-17 07:10:51,099 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 239 [2024-11-17 07:10:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:51,099 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2024-11-17 07:10:51,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.5) internal successors, (108), 9 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:10:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2024-11-17 07:10:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-17 07:10:51,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:51,101 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:51,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-17 07:10:51,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 07:10:51,302 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1159828700, now seen corresponding path program 1 times [2024-11-17 07:10:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262533805] [2024-11-17 07:10:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-17 07:10:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-17 07:10:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2024-11-17 07:10:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262533805] [2024-11-17 07:10:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262533805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:10:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:10:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:10:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124929997] [2024-11-17 07:10:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:10:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:10:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:10:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:52,170 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:52,216 INFO L93 Difference]: Finished difference Result 309 states and 349 transitions. [2024-11-17 07:10:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:10:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 242 [2024-11-17 07:10:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:52,218 INFO L225 Difference]: With dead ends: 309 [2024-11-17 07:10:52,218 INFO L226 Difference]: Without dead ends: 255 [2024-11-17 07:10:52,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:10:52,219 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:52,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 367 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:10:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-17 07:10:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2024-11-17 07:10:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.092741935483871) internal successors, (271), 248 states have internal predecessors, (271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2024-11-17 07:10:52,231 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 242 [2024-11-17 07:10:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:52,232 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2024-11-17 07:10:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:10:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2024-11-17 07:10:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-17 07:10:52,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:52,233 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 07:10:52,234 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 281899333, now seen corresponding path program 1 times [2024-11-17 07:10:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018978132] [2024-11-17 07:10:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 07:10:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-17 07:10:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-17 07:10:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-17 07:10:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:10:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018978132] [2024-11-17 07:10:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018978132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:10:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546998309] [2024-11-17 07:10:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:54,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:10:54,567 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:10:54,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-17 07:10:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:10:55,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 2033 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-17 07:10:55,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:10:55,427 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 1 [2024-11-17 07:10:55,554 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 16 treesize of output 8 [2024-11-17 07:10:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2024-11-17 07:10:55,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:10:55,677 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 15 [2024-11-17 07:10:55,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-17 07:10:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-17 07:10:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546998309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:10:55,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 07:10:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 16 [2024-11-17 07:10:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974546077] [2024-11-17 07:10:55,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 07:10:55,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 07:10:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:10:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 07:10:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-17 07:10:55,752 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:10:55,982 INFO L93 Difference]: Finished difference Result 377 states and 423 transitions. [2024-11-17 07:10:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:10:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 243 [2024-11-17 07:10:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:10:55,984 INFO L225 Difference]: With dead ends: 377 [2024-11-17 07:10:55,984 INFO L226 Difference]: Without dead ends: 329 [2024-11-17 07:10:55,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-17 07:10:55,985 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 07:10:55,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1176 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 07:10:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-17 07:10:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 257. [2024-11-17 07:10:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.0992063492063493) internal successors, (277), 252 states have internal predecessors, (277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:10:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2024-11-17 07:10:55,997 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 243 [2024-11-17 07:10:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:10:55,998 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2024-11-17 07:10:55,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:10:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2024-11-17 07:10:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-17 07:10:56,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:10:56,000 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:56,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-17 07:10:56,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:10:56,201 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:10:56,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:10:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -366370719, now seen corresponding path program 1 times [2024-11-17 07:10:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:10:56,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126914778] [2024-11-17 07:10:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:10:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:10:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:10:56,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 07:10:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:10:57,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 07:10:57,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 07:10:57,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-17 07:10:57,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-17 07:10:57,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-17 07:10:57,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-17 07:10:57,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-17 07:10:57,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-17 07:10:57,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-17 07:10:57,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-17 07:10:57,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-17 07:10:57,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-17 07:10:57,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-17 07:10:57,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-17 07:10:57,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-17 07:10:57,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 07:10:57,336 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:10:57,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 07:10:57,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 07:10:57 BoogieIcfgContainer [2024-11-17 07:10:57,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 07:10:57,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 07:10:57,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 07:10:57,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 07:10:57,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:10:23" (3/4) ... [2024-11-17 07:10:57,491 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 07:10:57,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 07:10:57,493 INFO L158 Benchmark]: Toolchain (without parser) took 35906.24ms. Allocated memory was 161.5MB in the beginning and 857.7MB in the end (delta: 696.3MB). Free memory was 88.6MB in the beginning and 345.2MB in the end (delta: -256.6MB). Peak memory consumption was 441.3MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,493 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:10:57,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.77ms. Allocated memory is still 161.5MB. Free memory was 88.4MB in the beginning and 98.0MB in the end (delta: -9.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.57ms. Allocated memory is still 161.5MB. Free memory was 98.0MB in the beginning and 91.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,494 INFO L158 Benchmark]: Boogie Preprocessor took 125.38ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 81.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,494 INFO L158 Benchmark]: IcfgBuilder took 1084.15ms. Allocated memory is still 161.5MB. Free memory was 80.6MB in the beginning and 82.1MB in the end (delta: -1.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,495 INFO L158 Benchmark]: TraceAbstraction took 33732.92ms. Allocated memory was 161.5MB in the beginning and 857.7MB in the end (delta: 696.3MB). Free memory was 80.8MB in the beginning and 345.2MB in the end (delta: -264.4MB). Peak memory consumption was 431.6MB. Max. memory is 16.1GB. [2024-11-17 07:10:57,495 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 857.7MB. Free memory is still 345.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:10:57,496 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.24ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.77ms. Allocated memory is still 161.5MB. Free memory was 88.4MB in the beginning and 98.0MB in the end (delta: -9.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.57ms. Allocated memory is still 161.5MB. Free memory was 98.0MB in the beginning and 91.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.38ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 81.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1084.15ms. Allocated memory is still 161.5MB. Free memory was 80.6MB in the beginning and 82.1MB in the end (delta: -1.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 33732.92ms. Allocated memory was 161.5MB in the beginning and 857.7MB in the end (delta: 696.3MB). Free memory was 80.8MB in the beginning and 345.2MB in the end (delta: -264.4MB). Peak memory consumption was 431.6MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 857.7MB. Free memory is still 345.2MB. 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: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 1383, overapproximation of strlen at line 1397, overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno = &bb_errno_location; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=10] [L1577] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] EXPR argc+1 VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] EXPR argc+1 VAL [applet_name={-1:0}, argc=2, argv={-13:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 [L1587] int i=0; VAL [applet_name={-1:0}, argc=2, argv={-13:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-14:0}, optind=1] [L1587] COND TRUE i= 2u) [L1395] argv = argv + 1l [L1396] EXPR \read(**argv) [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND TRUE !(s == ((const char *)((void *)0))) [L1484] EXPR \read(*s) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1484] COND FALSE !(!((signed int)*s == 0)) [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-26:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] m=strlen(s) [L1398] argv = argv + 1l [L1399] signed int tmp_statement_expression$6; [L1400] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1400] COND FALSE !(!(*argv == ((char *)((void *)0)))) [L1414] unsigned long int tmp_post$8 = m; [L1415] m = m + 1ul [L1416] s[(signed long int)tmp_post$8] = (char)10 [L1417] signed long int return_value_full_write$9; [L1418] CALL full_write(1, (const void *)s, m) [L1464] signed long int cc; [L1465] signed long int total = (signed long int)0; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1, ret=9223372036854775807] [L1571] return ret; VAL [\result=9223372036854775807, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=9223372036854775807, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=9223372036854775807, optind=1] [L1510] return n; VAL [\result=9223372036854775807, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, cc=9223372036854775807, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1475] EXPR total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, cc=9223372036854775807, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) [L1466] len = len - (unsigned long int)cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, dummy_utmp={11:0}, fd=1, len=331, optind=1, total=9223372036854775807] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=331, optind=1, ret=1] [L1571] return ret; VAL [\result=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=331, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, n=1, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, n=1, optind=1] [L1510] return n; VAL [\result=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, cc=1, dummy_utmp={11:0}, fd=1, len=331, optind=1, total=9223372036854775807] [L1475] total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, dummy_utmp={11:0}, fd=1, len=331, optind=1] - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 31, TraceHistogramMax: 33, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1011 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 12406 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8814 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 3592 mSDtfsCounter, 1318 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3965 GetRequests, 3796 SyntacticMatches, 2 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=25, InterpolantAutomatonStates: 172, 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, 30 MinimizatonAttempts, 281 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 5950 NumberOfCodeBlocks, 5616 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 7093 ConstructedInterpolants, 0 QuantifiedInterpolants, 17471 SizeOfPredicates, 22 NumberOfNonLiveVariables, 25430 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 59 InterpolantComputations, 20 PerfectInterpolantSequences, 24044/32659 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 07:10:57,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:10:59,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:10:59,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 07:10:59,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:10:59,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:10:59,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 07:10:59,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:10:59,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:10:59,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:10:59,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:10:59,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:10:59,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:10:59,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:10:59,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:10:59,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:10:59,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:10:59,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:10:59,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:10:59,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:10:59,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:10:59,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:10:59,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:10:59,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 07:10:59,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 07:10:59,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:10:59,943 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:10:59,944 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 07:10:59,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:10:59,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:10:59,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:10:59,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:10:59,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:10:59,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:10:59,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:10:59,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:10:59,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:10:59,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:10:59,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:10:59,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 07:10:59,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 07:10:59,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:10:59,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:10:59,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:10:59,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:10:59,956 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-17 07:11:00,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:11:00,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:11:00,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:11:00,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:11:00,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:11:00,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-17 07:11:01,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:11:02,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:11:02,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-17 07:11:02,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5ec5643/ded87b8c8739436ab563672ca094cb1c/FLAG8617c31c8 [2024-11-17 07:11:02,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5ec5643/ded87b8c8739436ab563672ca094cb1c [2024-11-17 07:11:02,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:11:02,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:11:02,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:11:02,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:11:02,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:11:02,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:11:02" (1/1) ... [2024-11-17 07:11:02,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a8817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:02, skipping insertion in model container [2024-11-17 07:11:02,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:11:02" (1/1) ... [2024-11-17 07:11:02,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:11:03,110 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,132 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,134 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,138 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,141 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,153 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,154 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,155 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,157 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,160 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 07:11:03,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:11:03,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:11:03,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:11:03,472 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:11:03,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03 WrapperNode [2024-11-17 07:11:03,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:11:03,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:11:03,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:11:03,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:11:03,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,592 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 727 [2024-11-17 07:11:03,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:11:03,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:11:03,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:11:03,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:11:03,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,684 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 12, 2, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 5, 1, 2]. [2024-11-17 07:11:03,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:11:03,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:11:03,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:11:03,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:11:03,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (1/1) ... [2024-11-17 07:11:03,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:11:03,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:11:03,809 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-11-17 07:11:03,815 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-11-17 07:11:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-17 07:11:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-17 07:11:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 07:11:03,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 07:11:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 07:11:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 07:11:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-17 07:11:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-17 07:11:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-17 07:11:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-17 07:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-17 07:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-17 07:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-17 07:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-17 07:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-17 07:11:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-17 07:11:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-17 07:11:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-17 07:11:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-17 07:11:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-17 07:11:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-17 07:11:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-17 07:11:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-17 07:11:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-17 07:11:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-17 07:11:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-17 07:11:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-17 07:11:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-17 07:11:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-17 07:11:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-17 07:11:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-17 07:11:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-17 07:11:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-17 07:11:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-17 07:11:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-17 07:11:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-17 07:11:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-17 07:11:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-17 07:11:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-17 07:11:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 07:11:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-17 07:11:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 07:11:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-17 07:11:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-17 07:11:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-17 07:11:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-17 07:11:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:11:03,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:11:04,383 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:11:04,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:11:05,286 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-17 07:11:05,287 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:11:05,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:11:05,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:11:05,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:11:05 BoogieIcfgContainer [2024-11-17 07:11:05,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:11:05,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:11:05,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:11:05,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:11:05,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:11:02" (1/3) ... [2024-11-17 07:11:05,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ca2a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:11:05, skipping insertion in model container [2024-11-17 07:11:05,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:11:03" (2/3) ... [2024-11-17 07:11:05,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ca2a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:11:05, skipping insertion in model container [2024-11-17 07:11:05,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:11:05" (3/3) ... [2024-11-17 07:11:05,321 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-17 07:11:05,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:11:05,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-17 07:11:05,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:11:05,417 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;@3e999291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:11:05,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-17 07:11:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 111 states have (on average 1.6036036036036037) internal successors, (178), 135 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 07:11:05,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:05,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 07:11:05,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:05,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 230909005, now seen corresponding path program 1 times [2024-11-17 07:11:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591240419] [2024-11-17 07:11:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:05,455 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-11-17 07:11:05,456 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-11-17 07:11:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:05,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 07:11:05,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:05,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:05,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591240419] [2024-11-17 07:11:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591240419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 07:11:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814658402] [2024-11-17 07:11:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 07:11:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:05,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 07:11:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:11:05,903 INFO L87 Difference]: Start difference. First operand has 139 states, 111 states have (on average 1.6036036036036037) internal successors, (178), 135 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:05,935 INFO L93 Difference]: Finished difference Result 254 states and 353 transitions. [2024-11-17 07:11:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 07:11:05,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 07:11:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:05,947 INFO L225 Difference]: With dead ends: 254 [2024-11-17 07:11:05,948 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 07:11:05,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:11:05,958 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:05,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 07:11:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-17 07:11:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.380952380952381) internal successors, (145), 114 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2024-11-17 07:11:06,034 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 5 [2024-11-17 07:11:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:06,036 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2024-11-17 07:11:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2024-11-17 07:11:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 07:11:06,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:06,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 07:11:06,049 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-11-17 07:11:06,242 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-11-17 07:11:06,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1431755266, now seen corresponding path program 1 times [2024-11-17 07:11:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141846476] [2024-11-17 07:11:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:06,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:06,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:06,249 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-11-17 07:11:06,250 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-11-17 07:11:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:06,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:11:06,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:06,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:06,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:06,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141846476] [2024-11-17 07:11:06,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141846476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:06,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:06,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:11:06,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862321939] [2024-11-17 07:11:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:06,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:11:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:11:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:06,620 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:06,673 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2024-11-17 07:11:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:11:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 07:11:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:06,677 INFO L225 Difference]: With dead ends: 234 [2024-11-17 07:11:06,677 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 07:11:06,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:06,679 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:06,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 286 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 07:11:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-17 07:11:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 118 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-17 07:11:06,696 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 6 [2024-11-17 07:11:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-17 07:11:06,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-17 07:11:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 07:11:06,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:06,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-17 07:11:06,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 07:11:06,900 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-11-17 07:11:06,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1969525929, now seen corresponding path program 1 times [2024-11-17 07:11:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314850039] [2024-11-17 07:11:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:06,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:06,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:06,911 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-11-17 07:11:06,912 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-11-17 07:11:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:07,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:11:07,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:07,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:07,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314850039] [2024-11-17 07:11:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314850039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:07,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-17 07:11:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347331748] [2024-11-17 07:11:07,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:07,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:07,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:07,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:07,320 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:07,411 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2024-11-17 07:11:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:07,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 07:11:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:07,413 INFO L225 Difference]: With dead ends: 240 [2024-11-17 07:11:07,414 INFO L226 Difference]: Without dead ends: 129 [2024-11-17 07:11:07,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:11:07,415 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:07,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 427 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:11:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-17 07:11:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-11-17 07:11:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 120 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2024-11-17 07:11:07,423 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 11 [2024-11-17 07:11:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:07,424 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2024-11-17 07:11:07,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 07:11:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2024-11-17 07:11:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 07:11:07,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:07,424 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:07,437 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-11-17 07:11:07,625 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-11-17 07:11:07,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:07,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1002836834, now seen corresponding path program 1 times [2024-11-17 07:11:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041732461] [2024-11-17 07:11:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:07,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:07,630 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-11-17 07:11:07,633 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-11-17 07:11:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:07,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:07,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:08,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:08,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041732461] [2024-11-17 07:11:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041732461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:08,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 07:11:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806981087] [2024-11-17 07:11:08,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 07:11:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 07:11:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:11:08,120 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:08,271 INFO L93 Difference]: Finished difference Result 254 states and 319 transitions. [2024-11-17 07:11:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:11:08,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-17 07:11:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:08,273 INFO L225 Difference]: With dead ends: 254 [2024-11-17 07:11:08,273 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 07:11:08,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:11:08,275 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 15 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:08,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 575 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:11:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 07:11:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-17 07:11:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 140 states have internal predecessors, (171), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-17 07:11:08,292 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 22 [2024-11-17 07:11:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:08,292 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-17 07:11:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-17 07:11:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 07:11:08,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:08,295 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:08,306 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-11-17 07:11:08,495 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-11-17 07:11:08,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 535519522, now seen corresponding path program 2 times [2024-11-17 07:11:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788478529] [2024-11-17 07:11:08,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:11:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:08,499 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-11-17 07:11:08,500 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-11-17 07:11:08,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:11:08,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:11:08,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:08,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-17 07:11:08,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:08,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788478529] [2024-11-17 07:11:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788478529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:11:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272316164] [2024-11-17 07:11:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:11:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:08,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:11:08,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:08,850 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:09,139 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2024-11-17 07:11:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:11:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-11-17 07:11:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:09,141 INFO L225 Difference]: With dead ends: 144 [2024-11-17 07:11:09,141 INFO L226 Difference]: Without dead ends: 142 [2024-11-17 07:11:09,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:09,142 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 129 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 403 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.3s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:09,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 403 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 07:11:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-17 07:11:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-17 07:11:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 138 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 173 transitions. [2024-11-17 07:11:09,150 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 173 transitions. Word has length 42 [2024-11-17 07:11:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 173 transitions. [2024-11-17 07:11:09,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 173 transitions. [2024-11-17 07:11:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 07:11:09,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:09,153 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:09,164 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-11-17 07:11:09,353 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-11-17 07:11:09,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash -334966117, now seen corresponding path program 1 times [2024-11-17 07:11:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324866859] [2024-11-17 07:11:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:09,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:09,356 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-11-17 07:11:09,357 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-11-17 07:11:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:09,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 07:11:09,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:09,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:11:10,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324866859] [2024-11-17 07:11:10,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324866859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:10,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:10,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-17 07:11:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976676736] [2024-11-17 07:11:10,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:10,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 07:11:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 07:11:10,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-17 07:11:10,008 INFO L87 Difference]: Start difference. First operand 142 states and 173 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:10,362 INFO L93 Difference]: Finished difference Result 270 states and 335 transitions. [2024-11-17 07:11:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:11:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-11-17 07:11:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:10,369 INFO L225 Difference]: With dead ends: 270 [2024-11-17 07:11:10,369 INFO L226 Difference]: Without dead ends: 162 [2024-11-17 07:11:10,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-17 07:11:10,370 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:10,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1295 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 07:11:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-17 07:11:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-17 07:11:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 152 states have (on average 1.243421052631579) internal successors, (189), 158 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2024-11-17 07:11:10,386 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 52 [2024-11-17 07:11:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:10,390 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2024-11-17 07:11:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2024-11-17 07:11:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 07:11:10,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:10,391 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:10,407 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 (7)] Forceful destruction successful, exit code 0 [2024-11-17 07:11:10,592 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-11-17 07:11:10,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:10,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1950322779, now seen corresponding path program 2 times [2024-11-17 07:11:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556753457] [2024-11-17 07:11:10,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:11:10,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:10,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:10,595 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-11-17 07:11:10,596 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-11-17 07:11:10,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:11:10,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:11:10,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:11:10,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:10,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:10,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556753457] [2024-11-17 07:11:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556753457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:10,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:11:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642794950] [2024-11-17 07:11:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:10,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:11:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:11:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:10,960 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:10,997 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2024-11-17 07:11:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:11:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-17 07:11:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:11,001 INFO L225 Difference]: With dead ends: 267 [2024-11-17 07:11:11,001 INFO L226 Difference]: Without dead ends: 167 [2024-11-17 07:11:11,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:11,003 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:11,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-17 07:11:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2024-11-17 07:11:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 162 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2024-11-17 07:11:11,018 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 72 [2024-11-17 07:11:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2024-11-17 07:11:11,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2024-11-17 07:11:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 07:11:11,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:11,020 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:11,033 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-11-17 07:11:11,220 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-11-17 07:11:11,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:11,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1145344927, now seen corresponding path program 1 times [2024-11-17 07:11:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937643893] [2024-11-17 07:11:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:11,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:11,225 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-11-17 07:11:11,226 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-11-17 07:11:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:11,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:11:11,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:11,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:11,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:11,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937643893] [2024-11-17 07:11:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937643893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:11:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648785173] [2024-11-17 07:11:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:11,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:11:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:11:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:11,620 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:11,647 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2024-11-17 07:11:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:11:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2024-11-17 07:11:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:11,649 INFO L225 Difference]: With dead ends: 172 [2024-11-17 07:11:11,649 INFO L226 Difference]: Without dead ends: 171 [2024-11-17 07:11:11,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:11,649 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:11,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-17 07:11:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-11-17 07:11:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 160 states have (on average 1.23125) internal successors, (197), 166 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2024-11-17 07:11:11,656 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 76 [2024-11-17 07:11:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:11,656 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2024-11-17 07:11:11,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2024-11-17 07:11:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 07:11:11,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:11,658 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:11,672 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-11-17 07:11:11,858 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-11-17 07:11:11,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:11,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1499908126, now seen corresponding path program 1 times [2024-11-17 07:11:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:11,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858475920] [2024-11-17 07:11:11,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:11,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:11,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:11,862 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-11-17 07:11:11,863 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-11-17 07:11:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:12,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 07:11:12,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:12,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:12,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858475920] [2024-11-17 07:11:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858475920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:12,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:11:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165258392] [2024-11-17 07:11:12,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:12,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:12,344 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:12,714 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2024-11-17 07:11:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-17 07:11:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:12,716 INFO L225 Difference]: With dead ends: 172 [2024-11-17 07:11:12,716 INFO L226 Difference]: Without dead ends: 171 [2024-11-17 07:11:12,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:11:12,717 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 155 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:12,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 476 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 07:11:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-17 07:11:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-17 07:11:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 160 states have (on average 1.225) internal successors, (196), 165 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2024-11-17 07:11:12,724 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 77 [2024-11-17 07:11:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:12,724 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2024-11-17 07:11:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2024-11-17 07:11:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 07:11:12,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:12,726 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:12,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 07:11:12,929 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-11-17 07:11:12,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1202924657, now seen corresponding path program 1 times [2024-11-17 07:11:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530453742] [2024-11-17 07:11:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:12,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:12,932 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-11-17 07:11:12,933 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-11-17 07:11:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:13,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:11:13,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:13,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:13,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530453742] [2024-11-17 07:11:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530453742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:13,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-17 07:11:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660906117] [2024-11-17 07:11:13,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:13,411 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:13,505 INFO L93 Difference]: Finished difference Result 283 states and 347 transitions. [2024-11-17 07:11:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-17 07:11:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:13,507 INFO L225 Difference]: With dead ends: 283 [2024-11-17 07:11:13,507 INFO L226 Difference]: Without dead ends: 176 [2024-11-17 07:11:13,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:11:13,508 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:13,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 683 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:11:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-17 07:11:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2024-11-17 07:11:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.2147239263803682) internal successors, (198), 167 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2024-11-17 07:11:13,515 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 77 [2024-11-17 07:11:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:13,515 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 202 transitions. [2024-11-17 07:11:13,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 202 transitions. [2024-11-17 07:11:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 07:11:13,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:13,517 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:13,530 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-11-17 07:11:13,717 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-11-17 07:11:13,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash -686103604, now seen corresponding path program 1 times [2024-11-17 07:11:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93596835] [2024-11-17 07:11:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:13,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:13,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:13,720 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-11-17 07:11:13,721 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-11-17 07:11:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:14,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:11:14,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:14,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:14,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93596835] [2024-11-17 07:11:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93596835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:11:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744640857] [2024-11-17 07:11:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:14,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:11:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:11:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:14,062 INFO L87 Difference]: Start difference. First operand 171 states and 202 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:14,077 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2024-11-17 07:11:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:11:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2024-11-17 07:11:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:14,079 INFO L225 Difference]: With dead ends: 235 [2024-11-17 07:11:14,079 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 07:11:14,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:11:14,080 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 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-11-17 07:11:14,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 07:11:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-17 07:11:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 147 states have internal predecessors, (172), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2024-11-17 07:11:14,086 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 81 [2024-11-17 07:11:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:14,086 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2024-11-17 07:11:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2024-11-17 07:11:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 07:11:14,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:14,087 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:14,101 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-11-17 07:11:14,291 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-11-17 07:11:14,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1354986405, now seen corresponding path program 1 times [2024-11-17 07:11:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433975281] [2024-11-17 07:11:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:14,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-11-17 07:11:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:14,293 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-11-17 07:11:14,294 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-11-17 07:11:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:14,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:11:14,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:14,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:14,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433975281] [2024-11-17 07:11:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433975281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:14,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:14,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-17 07:11:14,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700202517] [2024-11-17 07:11:14,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:14,727 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:14,806 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2024-11-17 07:11:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2024-11-17 07:11:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:14,808 INFO L225 Difference]: With dead ends: 164 [2024-11-17 07:11:14,808 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 07:11:14,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:11:14,809 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:14,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 558 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:11:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 07:11:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-17 07:11:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1755725190839694) internal successors, (154), 133 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2024-11-17 07:11:14,815 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 81 [2024-11-17 07:11:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2024-11-17 07:11:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2024-11-17 07:11:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-17 07:11:14,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:14,817 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:14,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 07:11:15,018 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-11-17 07:11:15,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1746947377, now seen corresponding path program 1 times [2024-11-17 07:11:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043908592] [2024-11-17 07:11:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:15,020 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-11-17 07:11:15,021 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-11-17 07:11:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:15,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:15,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:15,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:15,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043908592] [2024-11-17 07:11:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043908592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:15,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 07:11:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394457230] [2024-11-17 07:11:15,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 07:11:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 07:11:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:11:15,485 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:15,754 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2024-11-17 07:11:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:11:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2024-11-17 07:11:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:15,756 INFO L225 Difference]: With dead ends: 232 [2024-11-17 07:11:15,756 INFO L226 Difference]: Without dead ends: 157 [2024-11-17 07:11:15,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:11:15,757 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 12 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:15,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 586 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 07:11:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-17 07:11:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-17 07:11:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.1523178807947019) internal successors, (174), 153 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2024-11-17 07:11:15,764 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 83 [2024-11-17 07:11:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:15,764 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2024-11-17 07:11:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2024-11-17 07:11:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 07:11:15,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:15,765 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:15,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-17 07:11:15,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:15,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1552343545, now seen corresponding path program 1 times [2024-11-17 07:11:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307991287] [2024-11-17 07:11:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:15,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:11:15,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 07:11:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:16,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 07:11:16,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:16,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:16,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307991287] [2024-11-17 07:11:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307991287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 07:11:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93826360] [2024-11-17 07:11:16,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:16,481 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:16,800 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2024-11-17 07:11:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:16,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-17 07:11:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:16,802 INFO L225 Difference]: With dead ends: 252 [2024-11-17 07:11:16,802 INFO L226 Difference]: Without dead ends: 195 [2024-11-17 07:11:16,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:16,803 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 103 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:16,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 342 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 07:11:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-17 07:11:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2024-11-17 07:11:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 188 states have (on average 1.127659574468085) internal successors, (212), 190 states have internal predecessors, (212), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2024-11-17 07:11:16,811 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 100 [2024-11-17 07:11:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:16,812 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2024-11-17 07:11:16,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2024-11-17 07:11:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-17 07:11:16,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:16,813 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:16,831 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 (15)] Ended with exit code 0 [2024-11-17 07:11:17,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:17,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -299691584, now seen corresponding path program 1 times [2024-11-17 07:11:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612842996] [2024-11-17 07:11:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:17,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:17,018 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-11-17 07:11:17,019 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-11-17 07:11:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:17,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 07:11:17,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-17 07:11:17,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 87 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-17 07:11:17,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612842996] [2024-11-17 07:11:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612842996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:17,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-17 07:11:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694477463] [2024-11-17 07:11:17,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 07:11:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 07:11:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-17 07:11:17,793 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:11:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:18,388 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2024-11-17 07:11:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:11:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 138 [2024-11-17 07:11:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:18,390 INFO L225 Difference]: With dead ends: 332 [2024-11-17 07:11:18,390 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 07:11:18,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-17 07:11:18,391 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:18,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 908 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 07:11:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 07:11:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-17 07:11:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 228 states have (on average 1.105263157894737) internal successors, (252), 230 states have internal predecessors, (252), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 256 transitions. [2024-11-17 07:11:18,402 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 256 transitions. Word has length 138 [2024-11-17 07:11:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 256 transitions. [2024-11-17 07:11:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:11:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 256 transitions. [2024-11-17 07:11:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-17 07:11:18,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:18,404 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:18,422 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-11-17 07:11:18,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:18,605 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:18,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1586236736, now seen corresponding path program 2 times [2024-11-17 07:11:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:18,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047208392] [2024-11-17 07:11:18,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:11:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:18,607 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:11:18,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 07:11:18,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:11:18,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:11:18,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:18,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-17 07:11:18,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:18,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047208392] [2024-11-17 07:11:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047208392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:11:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863124607] [2024-11-17 07:11:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:11:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:11:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:18,998 INFO L87 Difference]: Start difference. First operand 234 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:19,042 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2024-11-17 07:11:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:11:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 158 [2024-11-17 07:11:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:19,044 INFO L225 Difference]: With dead ends: 262 [2024-11-17 07:11:19,044 INFO L226 Difference]: Without dead ends: 239 [2024-11-17 07:11:19,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:19,045 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:19,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 412 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-17 07:11:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-17 07:11:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 229 states have (on average 1.1048034934497817) internal successors, (253), 231 states have internal predecessors, (253), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2024-11-17 07:11:19,054 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 158 [2024-11-17 07:11:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:19,055 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2024-11-17 07:11:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2024-11-17 07:11:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-17 07:11:19,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:19,056 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:19,068 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 (17)] Ended with exit code 0 [2024-11-17 07:11:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11-17 07:11:19,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1557607585, now seen corresponding path program 1 times [2024-11-17 07:11:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:19,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46061730] [2024-11-17 07:11:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:19,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:19,263 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-11-17 07:11:19,264 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-11-17 07:11:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:19,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 07:11:19,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-17 07:11:20,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-17 07:11:20,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46061730] [2024-11-17 07:11:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46061730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:20,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-17 07:11:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522499948] [2024-11-17 07:11:20,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 07:11:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 07:11:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-17 07:11:20,731 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 07:11:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:21,608 INFO L93 Difference]: Finished difference Result 354 states and 395 transitions. [2024-11-17 07:11:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 07:11:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 158 [2024-11-17 07:11:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:21,610 INFO L225 Difference]: With dead ends: 354 [2024-11-17 07:11:21,610 INFO L226 Difference]: Without dead ends: 294 [2024-11-17 07:11:21,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-17 07:11:21,611 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 175 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:21,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 573 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 07:11:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-17 07:11:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2024-11-17 07:11:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 287 states have (on average 1.0871080139372822) internal successors, (312), 289 states have internal predecessors, (312), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 316 transitions. [2024-11-17 07:11:21,622 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 316 transitions. Word has length 158 [2024-11-17 07:11:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:21,622 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 316 transitions. [2024-11-17 07:11:21,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 07:11:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 316 transitions. [2024-11-17 07:11:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-17 07:11:21,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:21,625 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:21,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 (18)] Ended with exit code 0 [2024-11-17 07:11:21,825 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-11-17 07:11:21,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -174876968, now seen corresponding path program 2 times [2024-11-17 07:11:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056216428] [2024-11-17 07:11:21,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 07:11:21,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:21,829 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-11-17 07:11:21,830 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-11-17 07:11:22,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 07:11:22,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 07:11:22,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:22,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2024-11-17 07:11:22,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:22,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056216428] [2024-11-17 07:11:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056216428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:22,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:11:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493546951] [2024-11-17 07:11:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:11:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:11:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:22,231 INFO L87 Difference]: Start difference. First operand 293 states and 316 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:22,279 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2024-11-17 07:11:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:11:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 216 [2024-11-17 07:11:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:22,280 INFO L225 Difference]: With dead ends: 297 [2024-11-17 07:11:22,280 INFO L226 Difference]: Without dead ends: 296 [2024-11-17 07:11:22,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:11:22,281 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:22,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 396 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:11:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-17 07:11:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-17 07:11:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.083623693379791) internal successors, (311), 288 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 315 transitions. [2024-11-17 07:11:22,293 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 315 transitions. Word has length 216 [2024-11-17 07:11:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 315 transitions. [2024-11-17 07:11:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:11:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 315 transitions. [2024-11-17 07:11:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-17 07:11:22,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:22,295 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:22,306 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-11-17 07:11:22,499 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-11-17 07:11:22,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1126218718, now seen corresponding path program 1 times [2024-11-17 07:11:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964459193] [2024-11-17 07:11:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:22,502 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-11-17 07:11:22,503 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-11-17 07:11:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:23,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 07:11:23,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2024-11-17 07:11:23,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:11:23,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:23,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964459193] [2024-11-17 07:11:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964459193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:11:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:11:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:11:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358604483] [2024-11-17 07:11:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:11:23,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:11:23,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:23,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:11:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:23,500 INFO L87 Difference]: Start difference. First operand 292 states and 315 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:23,562 INFO L93 Difference]: Finished difference Result 312 states and 339 transitions. [2024-11-17 07:11:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:11:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 217 [2024-11-17 07:11:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:23,564 INFO L225 Difference]: With dead ends: 312 [2024-11-17 07:11:23,564 INFO L226 Difference]: Without dead ends: 311 [2024-11-17 07:11:23,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:11:23,565 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:23,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 404 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:11:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-17 07:11:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 306. [2024-11-17 07:11:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.0866666666666667) internal successors, (326), 301 states have internal predecessors, (326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:11:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2024-11-17 07:11:23,578 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 217 [2024-11-17 07:11:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:23,578 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2024-11-17 07:11:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:11:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2024-11-17 07:11:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-17 07:11:23,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:23,581 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:23,606 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 (20)] Ended with exit code 0 [2024-11-17 07:11:23,785 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 [2024-11-17 07:11:23,785 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1728853338, now seen corresponding path program 1 times [2024-11-17 07:11:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985097599] [2024-11-17 07:11:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:23,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:23,788 INFO L229 MonitoredProcess]: Starting monitored process 21 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-11-17 07:11:23,789 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 (21)] Waiting until timeout for monitored process [2024-11-17 07:11:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:25,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 07:11:25,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:25,508 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 21 treesize of output 1 [2024-11-17 07:11:25,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 07:11:25,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 07:11:25,795 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 19 treesize of output 11 [2024-11-17 07:11:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2024-11-17 07:11:25,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:25,974 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 16 [2024-11-17 07:11:25,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 [2024-11-17 07:11:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-17 07:11:26,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985097599] [2024-11-17 07:11:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985097599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:26,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2024-11-17 07:11:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002391479] [2024-11-17 07:11:26,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:26,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 07:11:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 07:11:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:11:26,239 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:11:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:27,289 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2024-11-17 07:11:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:11:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 235 [2024-11-17 07:11:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:27,293 INFO L225 Difference]: With dead ends: 365 [2024-11-17 07:11:27,293 INFO L226 Difference]: Without dead ends: 307 [2024-11-17 07:11:27,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-17 07:11:27,294 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 21 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:27,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 07:11:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-17 07:11:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2024-11-17 07:11:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.0833333333333333) internal successors, (325), 301 states have internal predecessors, (325), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:11:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 331 transitions. [2024-11-17 07:11:27,315 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 331 transitions. Word has length 235 [2024-11-17 07:11:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 331 transitions. [2024-11-17 07:11:27,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:11:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 331 transitions. [2024-11-17 07:11:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-17 07:11:27,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:27,318 INFO L215 NwaCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:27,361 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 (21)] Forceful destruction successful, exit code 0 [2024-11-17 07:11:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-11-17 07:11:27,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1828259747, now seen corresponding path program 1 times [2024-11-17 07:11:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401003469] [2024-11-17 07:11:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:27,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:27,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:27,523 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-11-17 07:11:27,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 (22)] Waiting until timeout for monitored process [2024-11-17 07:11:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:11:28,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 07:11:28,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:11:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 1642 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-17 07:11:29,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 07:11:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 1642 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-17 07:11:29,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:11:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401003469] [2024-11-17 07:11:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401003469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 07:11:29,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 07:11:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-17 07:11:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286731665] [2024-11-17 07:11:29,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 07:11:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 07:11:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:11:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 07:11:29,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:11:29,485 INFO L87 Difference]: Start difference. First operand 306 states and 331 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:11:30,243 INFO L93 Difference]: Finished difference Result 483 states and 518 transitions. [2024-11-17 07:11:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:11:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 239 [2024-11-17 07:11:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:11:30,246 INFO L225 Difference]: With dead ends: 483 [2024-11-17 07:11:30,246 INFO L226 Difference]: Without dead ends: 482 [2024-11-17 07:11:30,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:11:30,247 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 07:11:30,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 421 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 07:11:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-17 07:11:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 250. [2024-11-17 07:11:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.0938775510204082) internal successors, (268), 245 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:11:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2024-11-17 07:11:30,263 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 239 [2024-11-17 07:11:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:11:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2024-11-17 07:11:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:11:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2024-11-17 07:11:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-17 07:11:30,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:11:30,265 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:11:30,289 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 (22)] Forceful destruction successful, exit code 0 [2024-11-17 07:11:30,465 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-11-17 07:11:30,466 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 07:11:30,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:11:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1159828700, now seen corresponding path program 1 times [2024-11-17 07:11:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:11:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496201685] [2024-11-17 07:11:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:11:30,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:11:30,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:11:30,468 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-11-17 07:11:30,470 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