./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/dirname-1.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 deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:24:05,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:24:05,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 13:24:05,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:24:05,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:24:05,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:24:05,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:24:05,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:24:05,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:24:05,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:24:05,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:24:05,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:24:05,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:24:05,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:24:05,229 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:24:05,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:24:05,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:24:05,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:24:05,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:24:05,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:24:05,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:24:05,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:24:05,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:24:05,233 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:24:05,233 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:24:05,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:24:05,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:05,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:24:05,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:24:05,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:24:05,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:24:05,237 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-19 13:24:05,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:24:05,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:24:05,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:24:05,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:24:05,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:24:05,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-19 13:24:06,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:24:06,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:24:06,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-19 13:24:06,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92c06438/46432def72874590bb5b7dab48fae581/FLAG8c55ddf08 [2024-11-19 13:24:07,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92c06438/46432def72874590bb5b7dab48fae581 [2024-11-19 13:24:07,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:24:07,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:24:07,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:07,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:24:07,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:24:07,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:07,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c953d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07, skipping insertion in model container [2024-11-19 13:24:07,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:07,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:24:07,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:07,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:24:07,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:07,980 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:24:07,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07 WrapperNode [2024-11-19 13:24:07,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:07,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:07,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:24:07,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:24:07,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,055 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 669 [2024-11-19 13:24:08,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:08,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:24:08,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:24:08,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:24:08,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,102 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 2, 3, 3, 4, 4, 6, 4, 11, 4, 3, 44, 355, 2]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 0, 3, 3, 3, 3, 0, 3, 0, 3, 3, 42, 355, 0]. The 9 writes are split as follows [0, 0, 2, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 1]. [2024-11-19 13:24:08,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:24:08,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:24:08,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:24:08,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:24:08,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (1/1) ... [2024-11-19 13:24:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:08,176 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-19 13:24:08,188 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-19 13:24:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 13:24:08,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 13:24:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:24:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:24:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:24:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 13:24:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 13:24:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 13:24:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 13:24:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-19 13:24:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-19 13:24:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-19 13:24:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:24:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 13:24:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 13:24:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-19 13:24:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 13:24:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-19 13:24:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 13:24:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-19 13:24:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 13:24:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 13:24:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 13:24:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 13:24:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:24:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:24:08,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:24:08,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:24:08,956 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-19 13:24:08,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:24:08,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:24:08,970 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 13:24:08,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:08 BoogieIcfgContainer [2024-11-19 13:24:08,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:24:08,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:24:08,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:24:08,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:24:08,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:24:07" (1/3) ... [2024-11-19 13:24:08,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606ed66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:08, skipping insertion in model container [2024-11-19 13:24:08,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:07" (2/3) ... [2024-11-19 13:24:08,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606ed66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:08, skipping insertion in model container [2024-11-19 13:24:08,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:08" (3/3) ... [2024-11-19 13:24:08,977 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-19 13:24:08,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:24:08,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-19 13:24:09,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:24:09,064 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;@42f33a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:24:09,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-19 13:24:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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-19 13:24:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 13:24:09,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:09,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 13:24:09,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-19 13:24:09,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565792677] [2024-11-19 13:24:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:09,538 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-19 13:24:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565792677] [2024-11-19 13:24:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565792677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010371689] [2024-11-19 13:24:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:09,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:09,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:09,572 INFO L87 Difference]: Start difference. First operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 13:24:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:09,616 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-11-19 13:24:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-19 13:24:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:09,622 INFO L225 Difference]: With dead ends: 173 [2024-11-19 13:24:09,623 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 13:24:09,625 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-19 13:24:09,627 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:09,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 13:24:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 13:24:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 82 states have internal predecessors, (97), 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-19 13:24:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-19 13:24:09,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 4 [2024-11-19 13:24:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:09,667 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-19 13:24:09,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 13:24:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-19 13:24:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:24:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:09,668 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 13:24:09,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:24:09,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:09,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-19 13:24:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724887668] [2024-11-19 13:24:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:09,848 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-19 13:24:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724887668] [2024-11-19 13:24:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724887668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123021957] [2024-11-19 13:24:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:09,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:09,859 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-19 13:24:09,864 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-19 13:24:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:10,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:10,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:10,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123021957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 13:24:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443172319] [2024-11-19 13:24:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:10,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:24:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:24:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:10,172 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 13:24:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:10,197 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-19 13:24:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:24:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-19 13:24:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:10,200 INFO L225 Difference]: With dead ends: 85 [2024-11-19 13:24:10,200 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 13:24:10,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-19 13:24:10,201 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:10,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 13:24:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 13:24:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.6) internal successors, (96), 81 states have internal predecessors, (96), 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-19 13:24:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-19 13:24:10,209 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 7 [2024-11-19 13:24:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:10,209 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-19 13:24:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 13:24:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-19 13:24:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 13:24:10,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:10,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-19 13:24:10,223 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-19 13:24:10,410 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-19 13:24:10,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-19 13:24:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691406208] [2024-11-19 13:24:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:24:10,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:10,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691406208] [2024-11-19 13:24:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691406208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116083527] [2024-11-19 13:24:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:10,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:10,506 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 13:24:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:10,523 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-19 13:24:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 13:24:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:10,524 INFO L225 Difference]: With dead ends: 84 [2024-11-19 13:24:10,524 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 13:24:10,524 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-19 13:24:10,525 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:10,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 13:24:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-19 13:24:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.603448275862069) internal successors, (93), 78 states have internal predecessors, (93), 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-19 13:24:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-19 13:24:10,536 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 8 [2024-11-19 13:24:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:10,536 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-19 13:24:10,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 13:24:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-19 13:24:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 13:24:10,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:10,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:10,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:24:10,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:10,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash 216065076, now seen corresponding path program 1 times [2024-11-19 13:24:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688610499] [2024-11-19 13:24:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:10,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688610499] [2024-11-19 13:24:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688610499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272790276] [2024-11-19 13:24:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:10,693 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-19 13:24:10,697 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-19 13:24:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:10,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:10,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:24:10,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272790276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:10,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 13:24:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252828] [2024-11-19 13:24:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:10,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:10,934 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-19 13:24:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:10,955 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-19 13:24:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:10,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-19 13:24:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:10,958 INFO L225 Difference]: With dead ends: 81 [2024-11-19 13:24:10,958 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 13:24:10,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-19 13:24:10,959 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 92 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-19 13:24:10,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 92 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 13:24:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 13:24:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 76 states have internal predecessors, (91), 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-19 13:24:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-19 13:24:10,970 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 13 [2024-11-19 13:24:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:10,970 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-19 13:24:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-19 13:24:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-19 13:24:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 13:24:10,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:10,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:10,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:11,171 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-19 13:24:11,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:11,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1891917174, now seen corresponding path program 1 times [2024-11-19 13:24:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824900030] [2024-11-19 13:24:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824900030] [2024-11-19 13:24:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824900030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504394441] [2024-11-19 13:24:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:11,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:11,254 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-19 13:24:11,255 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-19 13:24:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:11,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:11,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:11,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504394441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:11,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 13:24:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777054637] [2024-11-19 13:24:11,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:11,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:11,508 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-19 13:24:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:11,531 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2024-11-19 13:24:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:11,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14 [2024-11-19 13:24:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:11,532 INFO L225 Difference]: With dead ends: 161 [2024-11-19 13:24:11,532 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 13:24:11,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-19 13:24:11,533 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:11,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 13:24:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 13:24:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.492537313432836) internal successors, (100), 85 states have internal predecessors, (100), 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-19 13:24:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-19 13:24:11,537 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 14 [2024-11-19 13:24:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:11,537 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-19 13:24:11,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-19 13:24:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-19 13:24:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 13:24:11,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:11,538 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:11,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 13:24:11,742 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-19 13:24:11,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1138585064, now seen corresponding path program 2 times [2024-11-19 13:24:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525128066] [2024-11-19 13:24:11,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:11,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:11,775 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 13:24:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:11,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525128066] [2024-11-19 13:24:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525128066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:24:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393430770] [2024-11-19 13:24:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:11,902 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 13:24:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:11,950 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-19 13:24:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23 [2024-11-19 13:24:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:11,951 INFO L225 Difference]: With dead ends: 88 [2024-11-19 13:24:11,951 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 13:24:11,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 13:24:11,952 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 77 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:11,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 246 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 13:24:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 13:24:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.462686567164179) internal successors, (98), 83 states have internal predecessors, (98), 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-19 13:24:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-19 13:24:11,960 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 23 [2024-11-19 13:24:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:11,960 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-19 13:24:11,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 13:24:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-19 13:24:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 13:24:11,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:11,961 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:11,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:24:11,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:11,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -649986637, now seen corresponding path program 1 times [2024-11-19 13:24:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210984493] [2024-11-19 13:24:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 13:24:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210984493] [2024-11-19 13:24:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210984493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106326653] [2024-11-19 13:24:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:12,146 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-19 13:24:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:12,161 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2024-11-19 13:24:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2024-11-19 13:24:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:12,162 INFO L225 Difference]: With dead ends: 150 [2024-11-19 13:24:12,162 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 13:24:12,163 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-19 13:24:12,164 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:12,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 168 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 13:24:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 13:24:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 86 states have internal predecessors, (101), 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-19 13:24:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-19 13:24:12,170 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 28 [2024-11-19 13:24:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-19 13:24:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-19 13:24:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-19 13:24:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 13:24:12,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:12,171 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:12,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 13:24:12,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:12,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2039246265, now seen corresponding path program 1 times [2024-11-19 13:24:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:12,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161501261] [2024-11-19 13:24:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 13:24:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161501261] [2024-11-19 13:24:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161501261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979137192] [2024-11-19 13:24:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:12,294 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-19 13:24:12,298 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-19 13:24:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:12,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 13:24:12,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 13:24:12,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 13:24:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979137192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:12,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-19 13:24:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533734893] [2024-11-19 13:24:12,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 13:24:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 13:24:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-19 13:24:12,619 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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-19 13:24:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:12,676 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2024-11-19 13:24:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 13:24:12,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 31 [2024-11-19 13:24:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:12,677 INFO L225 Difference]: With dead ends: 180 [2024-11-19 13:24:12,677 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 13:24:12,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-19 13:24:12,678 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:12,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 315 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 13:24:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 13:24:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 103 states have internal predecessors, (118), 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-19 13:24:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-19 13:24:12,683 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2024-11-19 13:24:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:12,683 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-19 13:24:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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-19 13:24:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-19 13:24:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:12,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:12,684 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:12,699 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-19 13:24:12,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:12,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash -800434536, now seen corresponding path program 1 times [2024-11-19 13:24:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902750209] [2024-11-19 13:24:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902750209] [2024-11-19 13:24:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902750209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:13,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:24:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594035579] [2024-11-19 13:24:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:13,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:13,051 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:13,057 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-11-19 13:24:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2024-11-19 13:24:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:13,058 INFO L225 Difference]: With dead ends: 124 [2024-11-19 13:24:13,058 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 13:24:13,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 13:24:13,058 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:13,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 13:24:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 13:24:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 76 states have internal predecessors, (84), 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-19 13:24:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-19 13:24:13,062 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 50 [2024-11-19 13:24:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:13,062 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-19 13:24:13,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-19 13:24:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:13,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:13,063 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 13:24:13,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 441966575, now seen corresponding path program 1 times [2024-11-19 13:24:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557520588] [2024-11-19 13:24:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 13:24:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:13,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557520588] [2024-11-19 13:24:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557520588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187601612] [2024-11-19 13:24:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:13,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:13,235 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:13,264 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-19 13:24:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2024-11-19 13:24:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:13,265 INFO L225 Difference]: With dead ends: 92 [2024-11-19 13:24:13,269 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 13:24:13,269 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-19 13:24:13,270 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:13,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 13:24:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-19 13:24:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 86 states have internal predecessors, (97), 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-19 13:24:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-19 13:24:13,278 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 50 [2024-11-19 13:24:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:13,278 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-19 13:24:13,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-19 13:24:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:13,279 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 13:24:13,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:13,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-19 13:24:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:13,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843120776] [2024-11-19 13:24:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 13:24:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843120776] [2024-11-19 13:24:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843120776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828295431] [2024-11-19 13:24:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:13,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:13,470 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:13,486 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-11-19 13:24:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2024-11-19 13:24:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:13,487 INFO L225 Difference]: With dead ends: 89 [2024-11-19 13:24:13,488 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 13:24:13,488 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-19 13:24:13,488 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 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-19 13:24:13,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 13:24:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-19 13:24:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 81 states have internal predecessors, (91), 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-19 13:24:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-19 13:24:13,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 50 [2024-11-19 13:24:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:13,499 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-19 13:24:13,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-19 13:24:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-19 13:24:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 13:24:13,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:13,500 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 13:24:13,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1496638887, now seen corresponding path program 1 times [2024-11-19 13:24:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780535484] [2024-11-19 13:24:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780535484] [2024-11-19 13:24:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780535484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370244488] [2024-11-19 13:24:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:13,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:13,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:13,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:13,771 INFO L87 Difference]: Start difference. First operand 84 states and 93 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-19 13:24:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:13,797 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-19 13:24:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:13,797 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 53 [2024-11-19 13:24:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:13,798 INFO L225 Difference]: With dead ends: 93 [2024-11-19 13:24:13,798 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 13:24:13,798 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-19 13:24:13,799 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:13,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 13:24:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 13:24:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.175) internal successors, (94), 84 states have internal predecessors, (94), 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-19 13:24:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-19 13:24:13,811 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 53 [2024-11-19 13:24:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-19 13:24:13,811 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-19 13:24:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-19 13:24:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 13:24:13,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:13,812 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 13:24:13,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 313800151, now seen corresponding path program 1 times [2024-11-19 13:24:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530547851] [2024-11-19 13:24:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530547851] [2024-11-19 13:24:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530547851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372848828] [2024-11-19 13:24:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:13,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:13,966 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-19 13:24:13,970 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-19 13:24:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:14,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:14,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:14,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:14,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372848828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:14,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:14,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 13:24:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904510995] [2024-11-19 13:24:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:14,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:24:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:24:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:14,238 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-19 13:24:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:14,250 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-19 13:24:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:24:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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 56 [2024-11-19 13:24:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:14,251 INFO L225 Difference]: With dead ends: 87 [2024-11-19 13:24:14,251 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 13:24:14,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-19 13:24:14,252 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 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-19 13:24:14,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 13:24:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 13:24:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 80 states have (on average 1.1625) internal successors, (93), 83 states have internal predecessors, (93), 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-19 13:24:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-19 13:24:14,255 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 56 [2024-11-19 13:24:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:14,255 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-19 13:24:14,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-19 13:24:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-19 13:24:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 13:24:14,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:14,256 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:14,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 13:24:14,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 13:24:14,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1137870308, now seen corresponding path program 1 times [2024-11-19 13:24:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119792262] [2024-11-19 13:24:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 13:24:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119792262] [2024-11-19 13:24:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119792262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:14,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634007793] [2024-11-19 13:24:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:14,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:14,559 INFO L87 Difference]: Start difference. First operand 86 states and 95 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-19 13:24:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:14,567 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-19 13:24:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:14,567 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 57 [2024-11-19 13:24:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:14,568 INFO L225 Difference]: With dead ends: 86 [2024-11-19 13:24:14,568 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 13:24:14,568 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-19 13:24:14,568 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 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-19 13:24:14,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 13:24:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-11-19 13:24:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 80 states have internal predecessors, (90), 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-19 13:24:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-11-19 13:24:14,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 57 [2024-11-19 13:24:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-11-19 13:24:14,571 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-19 13:24:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-11-19 13:24:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 13:24:14,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:14,572 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:14,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 13:24:14,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:14,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 914187780, now seen corresponding path program 1 times [2024-11-19 13:24:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507159409] [2024-11-19 13:24:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507159409] [2024-11-19 13:24:14,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507159409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800749393] [2024-11-19 13:24:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:14,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:14,668 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-19 13:24:14,670 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-19 13:24:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:14,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:14,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:14,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800749393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:14,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 13:24:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749145961] [2024-11-19 13:24:14,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:14,951 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-19 13:24:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:14,970 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-11-19 13:24:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:14,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 58 [2024-11-19 13:24:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:14,970 INFO L225 Difference]: With dead ends: 96 [2024-11-19 13:24:14,970 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 13:24:14,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-19 13:24:14,971 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:14,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 13:24:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 13:24:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 89 states have internal predecessors, (99), 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-19 13:24:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-19 13:24:14,974 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 58 [2024-11-19 13:24:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-19 13:24:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-19 13:24:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-19 13:24:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 13:24:14,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:14,975 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:14,989 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-19 13:24:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 13:24:15,176 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1414632936, now seen corresponding path program 1 times [2024-11-19 13:24:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275421400] [2024-11-19 13:24:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 13:24:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275421400] [2024-11-19 13:24:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275421400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627148755] [2024-11-19 13:24:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:15,304 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-19 13:24:15,306 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-19 13:24:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:15,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:15,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 13:24:15,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 13:24:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627148755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:15,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 13:24:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361582225] [2024-11-19 13:24:15,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:15,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:15,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:15,617 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-19 13:24:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:15,652 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2024-11-19 13:24:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 58 [2024-11-19 13:24:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:15,660 INFO L225 Difference]: With dead ends: 154 [2024-11-19 13:24:15,660 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 13:24:15,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-19 13:24:15,660 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:15,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 13:24:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 13:24:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1142857142857143) internal successors, (117), 107 states have internal predecessors, (117), 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-19 13:24:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-19 13:24:15,668 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 58 [2024-11-19 13:24:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-19 13:24:15,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-19 13:24:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-19 13:24:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 13:24:15,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:15,668 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1] [2024-11-19 13:24:15,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:15,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:15,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash 169510356, now seen corresponding path program 2 times [2024-11-19 13:24:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682229670] [2024-11-19 13:24:15,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:15,900 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:15,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-19 13:24:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682229670] [2024-11-19 13:24:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682229670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:15,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:24:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373815651] [2024-11-19 13:24:15,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:15,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:15,947 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-19 13:24:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:15,956 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-19 13:24:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 67 [2024-11-19 13:24:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:15,957 INFO L225 Difference]: With dead ends: 130 [2024-11-19 13:24:15,957 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 13:24:15,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 13:24:15,958 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:15,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 13:24:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 13:24:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 108 states have internal predecessors, (118), 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-19 13:24:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-19 13:24:15,961 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 67 [2024-11-19 13:24:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:15,961 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-19 13:24:15,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-19 13:24:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-19 13:24:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 13:24:15,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:15,962 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1] [2024-11-19 13:24:15,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 13:24:15,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:15,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -648138094, now seen corresponding path program 1 times [2024-11-19 13:24:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:15,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621094644] [2024-11-19 13:24:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-19 13:24:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621094644] [2024-11-19 13:24:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621094644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 13:24:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097162411] [2024-11-19 13:24:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:16,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:16,176 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-19 13:24:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:16,214 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2024-11-19 13:24:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 67 [2024-11-19 13:24:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:16,215 INFO L225 Difference]: With dead ends: 137 [2024-11-19 13:24:16,215 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 13:24:16,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:16,216 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:16,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 172 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 13:24:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-19 13:24:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.1111111111111112) internal successors, (120), 110 states have internal predecessors, (120), 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-19 13:24:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-11-19 13:24:16,220 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 67 [2024-11-19 13:24:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-11-19 13:24:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-19 13:24:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2024-11-19 13:24:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 13:24:16,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:16,221 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1] [2024-11-19 13:24:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 13:24:16,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -733468004, now seen corresponding path program 1 times [2024-11-19 13:24:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340686879] [2024-11-19 13:24:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:16,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340686879] [2024-11-19 13:24:16,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340686879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:16,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681008739] [2024-11-19 13:24:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:16,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:16,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:16,398 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-19 13:24:16,400 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-19 13:24:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:16,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 13:24:16,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:16,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681008739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:16,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 13:24:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853356423] [2024-11-19 13:24:16,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 13:24:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 13:24:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:24:16,876 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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-19 13:24:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:16,926 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2024-11-19 13:24:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 68 [2024-11-19 13:24:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:16,928 INFO L225 Difference]: With dead ends: 135 [2024-11-19 13:24:16,928 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 13:24:16,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 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-19 13:24:16,928 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:16,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 13:24:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-19 13:24:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0952380952380953) internal successors, (138), 128 states have internal predecessors, (138), 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-19 13:24:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-19 13:24:16,933 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 68 [2024-11-19 13:24:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:16,934 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-19 13:24:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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-19 13:24:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-19 13:24:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 13:24:16,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:16,935 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:16,955 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-19 13:24:17,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:17,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -967455130, now seen corresponding path program 2 times [2024-11-19 13:24:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013219480] [2024-11-19 13:24:17,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:17,230 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:17,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-19 13:24:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013219480] [2024-11-19 13:24:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013219480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838072455] [2024-11-19 13:24:17,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:17,325 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-19 13:24:17,327 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-19 13:24:17,681 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:17,681 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:17,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 13:24:17,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-19 13:24:17,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-19 13:24:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838072455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:17,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-19 13:24:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606875704] [2024-11-19 13:24:17,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:17,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 13:24:17,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:17,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 13:24:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-19 13:24:17,802 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-19 13:24:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:18,036 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2024-11-19 13:24:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 13:24:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-19 13:24:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:18,038 INFO L225 Difference]: With dead ends: 240 [2024-11-19 13:24:18,038 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 13:24:18,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 13:24:18,043 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:18,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 13:24:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-19 13:24:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.0679012345679013) internal successors, (173), 163 states have internal predecessors, (173), 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-19 13:24:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2024-11-19 13:24:18,052 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 76 [2024-11-19 13:24:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2024-11-19 13:24:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-19 13:24:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2024-11-19 13:24:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 13:24:18,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:18,052 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 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-19 13:24:18,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:18,253 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1724382876, now seen corresponding path program 2 times [2024-11-19 13:24:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202430157] [2024-11-19 13:24:18,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:18,328 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:18,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-19 13:24:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202430157] [2024-11-19 13:24:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202430157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:24:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080956655] [2024-11-19 13:24:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:18,551 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-19 13:24:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:18,614 INFO L93 Difference]: Finished difference Result 218 states and 231 transitions. [2024-11-19 13:24:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 86 [2024-11-19 13:24:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:18,615 INFO L225 Difference]: With dead ends: 218 [2024-11-19 13:24:18,619 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 13:24:18,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 13:24:18,620 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:18,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 13:24:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-19 13:24:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.0617283950617284) internal successors, (172), 163 states have internal predecessors, (172), 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-19 13:24:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions. [2024-11-19 13:24:18,628 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 86 [2024-11-19 13:24:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:18,628 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions. [2024-11-19 13:24:18,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-19 13:24:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions. [2024-11-19 13:24:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 13:24:18,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:18,633 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:18,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 13:24:18,633 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:18,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 1 times [2024-11-19 13:24:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020604572] [2024-11-19 13:24:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 13:24:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020604572] [2024-11-19 13:24:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020604572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149349441] [2024-11-19 13:24:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:18,955 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-19 13:24:18,959 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-19 13:24:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:19,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 1759 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:19,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 13:24:19,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 13:24:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149349441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:19,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-19 13:24:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58964267] [2024-11-19 13:24:19,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:19,594 INFO L87 Difference]: Start difference. First operand 166 states and 174 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) 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-19 13:24:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:19,647 INFO L93 Difference]: Finished difference Result 272 states and 288 transitions. [2024-11-19 13:24:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) 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 113 [2024-11-19 13:24:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:19,648 INFO L225 Difference]: With dead ends: 272 [2024-11-19 13:24:19,648 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 13:24:19,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 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-19 13:24:19,649 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:19,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 13:24:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-19 13:24:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.0599250936329587) internal successors, (283), 268 states have internal predecessors, (283), 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-19 13:24:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 285 transitions. [2024-11-19 13:24:19,656 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 285 transitions. Word has length 113 [2024-11-19 13:24:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:19,657 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 285 transitions. [2024-11-19 13:24:19,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) 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-19 13:24:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 285 transitions. [2024-11-19 13:24:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 13:24:19,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:19,657 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1] [2024-11-19 13:24:19,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 13:24:19,861 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,SelfDestructingSolverStorable21 [2024-11-19 13:24:19,862 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -563744935, now seen corresponding path program 1 times [2024-11-19 13:24:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852348047] [2024-11-19 13:24:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852348047] [2024-11-19 13:24:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852348047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993275649] [2024-11-19 13:24:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:20,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:20,226 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-19 13:24:20,227 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-19 13:24:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:20,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 13:24:20,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:20,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993275649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:20,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-19 13:24:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471770351] [2024-11-19 13:24:20,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 13:24:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 13:24:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-19 13:24:20,856 INFO L87 Difference]: Start difference. First operand 271 states and 285 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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-19 13:24:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:20,933 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2024-11-19 13:24:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 13:24:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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 121 [2024-11-19 13:24:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:20,935 INFO L225 Difference]: With dead ends: 311 [2024-11-19 13:24:20,935 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 13:24:20,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-19 13:24:20,939 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:20,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 13:24:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-19 13:24:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 303 states have (on average 1.0528052805280528) internal successors, (319), 304 states have internal predecessors, (319), 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-19 13:24:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 321 transitions. [2024-11-19 13:24:20,949 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 321 transitions. Word has length 121 [2024-11-19 13:24:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:20,949 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 321 transitions. [2024-11-19 13:24:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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-19 13:24:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 321 transitions. [2024-11-19 13:24:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 13:24:20,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:20,951 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 10, 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, 1] [2024-11-19 13:24:20,970 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-19 13:24:21,151 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,SelfDestructingSolverStorable22 [2024-11-19 13:24:21,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 284015833, now seen corresponding path program 2 times [2024-11-19 13:24:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098145550] [2024-11-19 13:24:21,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:21,344 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:21,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098145550] [2024-11-19 13:24:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098145550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702029466] [2024-11-19 13:24:22,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:22,126 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-19 13:24:22,128 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-19 13:24:22,605 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:22,605 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:22,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 13:24:22,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:22,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702029466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:23,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2024-11-19 13:24:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151981057] [2024-11-19 13:24:23,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-19 13:24:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-19 13:24:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 13:24:23,231 INFO L87 Difference]: Start difference. First operand 307 states and 321 transitions. Second operand has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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-19 13:24:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:23,361 INFO L93 Difference]: Finished difference Result 371 states and 404 transitions. [2024-11-19 13:24:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 13:24:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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 157 [2024-11-19 13:24:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:23,362 INFO L225 Difference]: With dead ends: 371 [2024-11-19 13:24:23,363 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 13:24:23,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 13:24:23,364 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:23,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 13:24:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-19 13:24:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 363 states have (on average 1.044077134986226) internal successors, (379), 364 states have internal predecessors, (379), 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-19 13:24:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 381 transitions. [2024-11-19 13:24:23,406 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 381 transitions. Word has length 157 [2024-11-19 13:24:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 381 transitions. [2024-11-19 13:24:23,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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-19 13:24:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 381 transitions. [2024-11-19 13:24:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-19 13:24:23,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:23,409 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 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, 1] [2024-11-19 13:24:23,431 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-19 13:24:23,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 13:24:23,609 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -65465511, now seen corresponding path program 3 times [2024-11-19 13:24:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866948984] [2024-11-19 13:24:23,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 13:24:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:28,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2024-11-19 13:24:28,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 13:24:28,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:24:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:24:29,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 13:24:29,029 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:24:29,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE (24 of 25 remaining) [2024-11-19 13:24:29,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2024-11-19 13:24:29,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2024-11-19 13:24:29,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2024-11-19 13:24:29,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2024-11-19 13:24:29,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2024-11-19 13:24:29,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2024-11-19 13:24:29,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2024-11-19 13:24:29,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2024-11-19 13:24:29,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2024-11-19 13:24:29,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 13:24:29,037 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:29,145 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:24:29,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:24:29 BoogieIcfgContainer [2024-11-19 13:24:29,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:24:29,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:24:29,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:24:29,148 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:24:29,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:08" (3/4) ... [2024-11-19 13:24:29,150 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:24:29,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:24:29,152 INFO L158 Benchmark]: Toolchain (without parser) took 21879.56ms. Allocated memory was 155.2MB in the beginning and 780.1MB in the end (delta: 625.0MB). Free memory was 81.4MB in the beginning and 668.3MB in the end (delta: -586.9MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,152 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:24:29,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.84ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 81.2MB in the beginning and 154.7MB in the end (delta: -73.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.93ms. Allocated memory is still 216.0MB. Free memory was 154.7MB in the beginning and 148.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,152 INFO L158 Benchmark]: Boogie Preprocessor took 82.81ms. Allocated memory is still 216.0MB. Free memory was 148.5MB in the beginning and 141.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,153 INFO L158 Benchmark]: RCFGBuilder took 830.27ms. Allocated memory is still 216.0MB. Free memory was 141.1MB in the beginning and 157.9MB in the end (delta: -16.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,153 INFO L158 Benchmark]: TraceAbstraction took 20175.86ms. Allocated memory was 216.0MB in the beginning and 780.1MB in the end (delta: 564.1MB). Free memory was 156.9MB in the beginning and 668.3MB in the end (delta: -511.4MB). Peak memory consumption was 376.4MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,153 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 780.1MB. Free memory is still 668.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:24:29,154 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.84ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 81.2MB in the beginning and 154.7MB in the end (delta: -73.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.93ms. Allocated memory is still 216.0MB. Free memory was 154.7MB in the beginning and 148.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.81ms. Allocated memory is still 216.0MB. Free memory was 148.5MB in the beginning and 141.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 830.27ms. Allocated memory is still 216.0MB. Free memory was 141.1MB in the beginning and 157.9MB in the end (delta: -16.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20175.86ms. Allocated memory was 216.0MB in the beginning and 780.1MB in the end (delta: 564.1MB). Free memory was 156.9MB in the beginning and 668.3MB in the end (delta: -511.4MB). Peak memory consumption was 376.4MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 780.1MB. Free memory is still 668.3MB. 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: 1162]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1162. Possible FailurePath: [L1136] static const char *applet_name; [L1137] static signed int bb_errno_location; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1304] char *a = malloc(11); [L1305] a[10] = 0 [L1306] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=1] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=2] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=3] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=4] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=5] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=6] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=7] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=8] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=9] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=10] [L1306] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1308] applet_name = a [L1309] bb_errno_location = __VERIFIER_nondet_int() [L1310] optind = 1 [L1311] int argc = __VERIFIER_nondet_int(); [L1312] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1312] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1313] EXPR argc+1 [L1313] char **argv=malloc((argc+1)*sizeof(char*)); [L1314] EXPR argc+1 [L1314] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1315] argv[argc]=0 [L1316] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0, mem_track={-13:0}, optind=1] [L1316] COND TRUE i 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-19 13:24:31,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:24:31,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:24:31,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:24:31,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:24:31,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:24:31,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-19 13:24:33,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:24:33,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:24:33,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-19 13:24:33,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4382a6a86/40040fe8015d42bb9cc03294931a8705/FLAG1c20f7fa5 [2024-11-19 13:24:33,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4382a6a86/40040fe8015d42bb9cc03294931a8705 [2024-11-19 13:24:33,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:24:33,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:24:33,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:33,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:24:33,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:24:33,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:33" (1/1) ... [2024-11-19 13:24:33,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb5cf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:33, skipping insertion in model container [2024-11-19 13:24:33,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:33" (1/1) ... [2024-11-19 13:24:33,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:24:33,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:33,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:33,938 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:33,947 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:33,958 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:33,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:33,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:24:34,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:34,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:24:34,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34 WrapperNode [2024-11-19 13:24:34,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:34,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:34,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:24:34,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:24:34,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,270 INFO L138 Inliner]: procedures = 351, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 663 [2024-11-19 13:24:34,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:34,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:24:34,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:24:34,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:24:34,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,327 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 2, 4, 4, 2, 4, 4, 3, 44, 355, 11, 6]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 0, 3, 3, 0, 3, 3, 3, 42, 355, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 2, 0, 2, 2]. [2024-11-19 13:24:34,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:24:34,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:24:34,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:24:34,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:24:34,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:34,439 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-19 13:24:34,447 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-19 13:24:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 13:24:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 13:24:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-19 13:24:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 13:24:34,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 13:24:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:24:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-19 13:24:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-19 13:24:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-19 13:24:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-19 13:24:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-19 13:24:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-19 13:24:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 13:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 13:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 13:24:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-19 13:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-19 13:24:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:24:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:24:34,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:24:34,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:24:35,360 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-19 13:24:35,360 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:24:35,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:24:35,372 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 13:24:35,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:35 BoogieIcfgContainer [2024-11-19 13:24:35,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:24:35,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:24:35,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:24:35,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:24:35,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:24:33" (1/3) ... [2024-11-19 13:24:35,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794fa2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:35, skipping insertion in model container [2024-11-19 13:24:35,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34" (2/3) ... [2024-11-19 13:24:35,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794fa2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:35, skipping insertion in model container [2024-11-19 13:24:35,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:35" (3/3) ... [2024-11-19 13:24:35,381 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-19 13:24:35,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:24:35,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-19 13:24:35,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:24:35,472 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;@5f3a7166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:24:35,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-19 13:24:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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-19 13:24:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 13:24:35,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:35,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 13:24:35,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:35,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-19 13:24:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633611062] [2024-11-19 13:24:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:35,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-19 13:24:35,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:35,501 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-19 13:24:35,523 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-19 13:24:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:35,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 13:24:35,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:35,816 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-19 13:24:35,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:35,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633611062] [2024-11-19 13:24:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633611062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:35,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 13:24:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836533935] [2024-11-19 13:24:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 13:24:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 13:24:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:24:35,843 INFO L87 Difference]: Start difference. First operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-19 13:24:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:35,862 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2024-11-19 13:24:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 13:24:35,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-19 13:24:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:35,869 INFO L225 Difference]: With dead ends: 154 [2024-11-19 13:24:35,869 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 13:24:35,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-19 13:24:35,873 INFO L432 NwaCegarLoop]: 81 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, 81 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-19 13:24:35,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 13:24:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-19 13:24:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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-19 13:24:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-19 13:24:35,913 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 4 [2024-11-19 13:24:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:35,917 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-19 13:24:35,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-19 13:24:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-19 13:24:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 13:24:35,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:35,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 13:24:35,935 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-19 13:24:36,118 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-19 13:24:36,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:36,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-19 13:24:36,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:36,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646716767] [2024-11-19 13:24:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:36,121 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-19 13:24:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:36,123 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-19 13:24:36,124 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-19 13:24:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:36,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:36,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:36,452 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-19 13:24:36,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:36,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646716767] [2024-11-19 13:24:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646716767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:36,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662962107] [2024-11-19 13:24:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:36,455 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. 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-19 13:24:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:36,481 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2024-11-19 13:24:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:36,481 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-19 13:24:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:36,482 INFO L225 Difference]: With dead ends: 132 [2024-11-19 13:24:36,482 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 13:24:36,483 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-19 13:24:36,483 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:36,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 13:24:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 13:24:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 67 states have internal predecessors, (82), 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-19 13:24:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-19 13:24:36,489 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 5 [2024-11-19 13:24:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-19 13:24:36,490 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-19 13:24:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-19 13:24:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 13:24:36,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:36,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-19 13:24:36,499 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-19 13:24:36,694 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-19 13:24:36,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-19 13:24:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682147831] [2024-11-19 13:24:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:36,697 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-19 13:24:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:36,703 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-19 13:24:36,704 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-19 13:24:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:36,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:36,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:36,985 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-19 13:24:36,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:37,014 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-19 13:24:37,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682147831] [2024-11-19 13:24:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682147831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:37,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 13:24:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003561805] [2024-11-19 13:24:37,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:37,016 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-19 13:24:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:37,075 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-11-19 13:24:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 8 [2024-11-19 13:24:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:37,076 INFO L225 Difference]: With dead ends: 135 [2024-11-19 13:24:37,077 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 13:24:37,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-19 13:24:37,078 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:37,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 13:24:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-19 13:24:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 67 states have internal predecessors, (82), 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-19 13:24:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-19 13:24:37,085 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 8 [2024-11-19 13:24:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-19 13:24:37,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-19 13:24:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-19 13:24:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 13:24:37,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:37,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:37,097 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-19 13:24:37,286 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-19 13:24:37,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 894156632, now seen corresponding path program 1 times [2024-11-19 13:24:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27863536] [2024-11-19 13:24:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:37,288 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-19 13:24:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:37,292 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-19 13:24:37,293 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-19 13:24:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:37,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:37,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:37,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:37,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27863536] [2024-11-19 13:24:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27863536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:37,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 13:24:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119152051] [2024-11-19 13:24:37,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 13:24:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 13:24:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 13:24:37,647 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-19 13:24:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:37,738 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2024-11-19 13:24:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 13:24:37,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-19 13:24:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:37,739 INFO L225 Difference]: With dead ends: 143 [2024-11-19 13:24:37,739 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 13:24:37,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:24:37,740 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:37,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 373 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 13:24:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 13:24:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 79 states have internal predecessors, (94), 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-19 13:24:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-19 13:24:37,747 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 17 [2024-11-19 13:24:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:37,747 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-19 13:24:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-19 13:24:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-19 13:24:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 13:24:37,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:37,748 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:37,760 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 (5)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:37,949 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-19 13:24:37,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash -742370088, now seen corresponding path program 2 times [2024-11-19 13:24:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:37,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429936159] [2024-11-19 13:24:37,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:37,951 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-19 13:24:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:37,953 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-19 13:24:37,954 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-19 13:24:38,212 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:38,212 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:38,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:38,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 13:24:38,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:38,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429936159] [2024-11-19 13:24:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429936159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:38,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:24:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745652967] [2024-11-19 13:24:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:38,314 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 13:24:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:38,613 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-19 13:24:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 29 [2024-11-19 13:24:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:38,617 INFO L225 Difference]: With dead ends: 82 [2024-11-19 13:24:38,617 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 13:24:38,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:38,618 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:38,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 210 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 13:24:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 13:24:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 13:24:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 77 states have internal predecessors, (92), 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-19 13:24:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-19 13:24:38,636 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 29 [2024-11-19 13:24:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:38,640 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-19 13:24:38,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 13:24:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-19 13:24:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 13:24:38,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:38,641 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:38,652 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-19 13:24:38,841 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-19 13:24:38,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:38,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1569821756, now seen corresponding path program 1 times [2024-11-19 13:24:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403395441] [2024-11-19 13:24:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:38,852 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-19 13:24:38,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:38,855 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-19 13:24:38,856 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-19 13:24:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:39,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 13:24:39,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:39,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:39,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403395441] [2024-11-19 13:24:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403395441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:39,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 13:24:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270929635] [2024-11-19 13:24:39,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 13:24:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 13:24:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-19 13:24:39,547 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-19 13:24:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:39,890 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-19 13:24:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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 35 [2024-11-19 13:24:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:39,891 INFO L225 Difference]: With dead ends: 151 [2024-11-19 13:24:39,891 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 13:24:39,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 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-19 13:24:39,892 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:39,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 723 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 13:24:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 13:24:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 13:24:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 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-19 13:24:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-19 13:24:39,912 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 35 [2024-11-19 13:24:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-19 13:24:39,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-19 13:24:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-19 13:24:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 13:24:39,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:39,913 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:39,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 13:24:40,113 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-19 13:24:40,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 200843588, now seen corresponding path program 2 times [2024-11-19 13:24:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979819497] [2024-11-19 13:24:40,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:40,115 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-19 13:24:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:40,117 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-19 13:24:40,118 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-19 13:24:40,377 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:40,377 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:40,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:40,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:40,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:40,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979819497] [2024-11-19 13:24:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979819497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:40,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134860126] [2024-11-19 13:24:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:40,398 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-19 13:24:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:40,424 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2024-11-19 13:24:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2024-11-19 13:24:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:40,425 INFO L225 Difference]: With dead ends: 144 [2024-11-19 13:24:40,425 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 13:24:40,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-19 13:24:40,426 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:40,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 13:24:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 13:24:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 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-19 13:24:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-19 13:24:40,435 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 47 [2024-11-19 13:24:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:40,439 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-19 13:24:40,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-19 13:24:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-19 13:24:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:40,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:40,440 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:40,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:40,640 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-19 13:24:40,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-19 13:24:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463341924] [2024-11-19 13:24:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:40,642 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-19 13:24:40,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:40,645 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-19 13:24:40,647 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-19 13:24:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:41,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:41,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:41,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:41,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463341924] [2024-11-19 13:24:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463341924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:41,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:41,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 13:24:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638920984] [2024-11-19 13:24:41,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:41,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:41,124 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-19 13:24:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:41,319 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2024-11-19 13:24:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 50 [2024-11-19 13:24:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:41,320 INFO L225 Difference]: With dead ends: 150 [2024-11-19 13:24:41,320 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 13:24:41,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 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-19 13:24:41,321 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:41,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 13:24:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-19 13:24:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.202247191011236) internal successors, (107), 92 states have internal predecessors, (107), 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-19 13:24:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-19 13:24:41,330 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 50 [2024-11-19 13:24:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:41,331 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-19 13:24:41,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-19 13:24:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-19 13:24:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 13:24:41,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:41,332 INFO L215 NwaCegarLoop]: trace histogram [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-19 13:24:41,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 13:24:41,532 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-19 13:24:41,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:41,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash -848834540, now seen corresponding path program 1 times [2024-11-19 13:24:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123686913] [2024-11-19 13:24:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:41,535 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-19 13:24:41,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:41,537 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-19 13:24:41,538 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-19 13:24:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:41,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:41,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:41,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:41,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123686913] [2024-11-19 13:24:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123686913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:41,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:41,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:24:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644045569] [2024-11-19 13:24:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:41,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:41,859 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 13:24:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:41,874 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-11-19 13:24:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 54 [2024-11-19 13:24:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:41,875 INFO L225 Difference]: With dead ends: 106 [2024-11-19 13:24:41,875 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 13:24:41,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-19 13:24:41,876 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:41,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 13:24:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 13:24:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.2) internal successors, (108), 93 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-19 13:24:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-19 13:24:41,882 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 54 [2024-11-19 13:24:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:41,882 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-19 13:24:41,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 13:24:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-19 13:24:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 13:24:41,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:41,883 INFO L215 NwaCegarLoop]: trace histogram [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-19 13:24:41,896 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-19 13:24:42,083 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-19 13:24:42,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 926172822, now seen corresponding path program 1 times [2024-11-19 13:24:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432769437] [2024-11-19 13:24:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:42,085 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-19 13:24:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:42,087 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-19 13:24:42,088 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-19 13:24:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:42,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 13:24:42,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:42,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:42,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432769437] [2024-11-19 13:24:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432769437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 13:24:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322033803] [2024-11-19 13:24:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:42,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:42,520 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-19 13:24:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:42,764 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-19 13:24:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 54 [2024-11-19 13:24:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:42,766 INFO L225 Difference]: With dead ends: 113 [2024-11-19 13:24:42,766 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 13:24:42,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:42,766 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 13:24:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-19 13:24:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 95 states have internal predecessors, (110), 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-19 13:24:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-19 13:24:42,772 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 54 [2024-11-19 13:24:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:42,772 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-19 13:24:42,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-19 13:24:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-19 13:24:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 13:24:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:42,773 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:42,787 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-19 13:24:42,973 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-19 13:24:42,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -909455939, now seen corresponding path program 1 times [2024-11-19 13:24:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972991477] [2024-11-19 13:24:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:42,975 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-19 13:24:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:42,977 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-19 13:24:42,978 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-19 13:24:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:43,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:43,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:43,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:43,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972991477] [2024-11-19 13:24:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972991477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:43,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 13:24:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708944837] [2024-11-19 13:24:43,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 13:24:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 13:24:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 13:24:43,420 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-19 13:24:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:43,647 INFO L93 Difference]: Finished difference Result 165 states and 196 transitions. [2024-11-19 13:24:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 13:24:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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 54 [2024-11-19 13:24:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:43,648 INFO L225 Difference]: With dead ends: 165 [2024-11-19 13:24:43,649 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 13:24:43,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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-19 13:24:43,649 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 8 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:43,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 354 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 13:24:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 13:24:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 107 states have internal predecessors, (122), 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-19 13:24:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-19 13:24:43,654 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 54 [2024-11-19 13:24:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:43,655 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-19 13:24:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-19 13:24:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-19 13:24:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 13:24:43,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:43,656 INFO L215 NwaCegarLoop]: trace histogram [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-19 13:24:43,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 13:24:43,856 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-19 13:24:43,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:43,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1726736795, now seen corresponding path program 1 times [2024-11-19 13:24:43,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:43,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905988079] [2024-11-19 13:24:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:43,858 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-19 13:24:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:43,859 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-19 13:24:43,861 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-19 13:24:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:44,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:44,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:44,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:44,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905988079] [2024-11-19 13:24:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905988079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:24:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922197663] [2024-11-19 13:24:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:44,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:44,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:44,175 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-19 13:24:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:44,184 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2024-11-19 13:24:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2024-11-19 13:24:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:44,186 INFO L225 Difference]: With dead ends: 128 [2024-11-19 13:24:44,186 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 13:24:44,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-19 13:24:44,186 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 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-19 13:24:44,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 13:24:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 13:24:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 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-19 13:24:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-19 13:24:44,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 55 [2024-11-19 13:24:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:44,191 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-19 13:24:44,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-19 13:24:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-19 13:24:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 13:24:44,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:44,192 INFO L215 NwaCegarLoop]: trace histogram [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-19 13:24:44,206 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-19 13:24:44,392 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-19 13:24:44,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:44,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash 84280908, now seen corresponding path program 1 times [2024-11-19 13:24:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:44,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451741486] [2024-11-19 13:24:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:44,393 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-19 13:24:44,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:44,395 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-19 13:24:44,396 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-19 13:24:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:44,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:44,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:44,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:44,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451741486] [2024-11-19 13:24:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451741486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23433220] [2024-11-19 13:24:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:44,755 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-19 13:24:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:44,778 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-19 13:24:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2024-11-19 13:24:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:44,779 INFO L225 Difference]: With dead ends: 100 [2024-11-19 13:24:44,779 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 13:24:44,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-19 13:24:44,780 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:44,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 13:24:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 13:24:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.1111111111111112) internal successors, (100), 92 states have internal predecessors, (100), 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-19 13:24:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-19 13:24:44,795 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 55 [2024-11-19 13:24:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-19 13:24:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-19 13:24:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-19 13:24:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 13:24:44,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:44,796 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:44,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 13:24:44,997 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-19 13:24:44,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1743125332, now seen corresponding path program 1 times [2024-11-19 13:24:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486167446] [2024-11-19 13:24:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:44,998 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-19 13:24:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:44,999 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-19 13:24:45,001 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-19 13:24:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:45,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:45,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:45,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:45,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486167446] [2024-11-19 13:24:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486167446] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:45,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 13:24:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773602472] [2024-11-19 13:24:45,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:45,422 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-19 13:24:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:45,500 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-19 13:24:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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 58 [2024-11-19 13:24:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:45,504 INFO L225 Difference]: With dead ends: 103 [2024-11-19 13:24:45,504 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 13:24:45,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 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-19 13:24:45,505 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:45,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 13:24:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-19 13:24:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.098901098901099) internal successors, (100), 92 states have internal predecessors, (100), 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-19 13:24:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-19 13:24:45,513 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 58 [2024-11-19 13:24:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-19 13:24:45,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-19 13:24:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-19 13:24:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 13:24:45,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:45,514 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 13:24:45,527 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-19 13:24:45,714 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-19 13:24:45,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1028886172, now seen corresponding path program 1 times [2024-11-19 13:24:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705798693] [2024-11-19 13:24:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:45,715 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-19 13:24:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:45,718 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-19 13:24:45,720 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-19 13:24:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:46,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:46,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:46,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:46,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:46,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705798693] [2024-11-19 13:24:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705798693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:46,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 13:24:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131615784] [2024-11-19 13:24:46,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:46,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 13:24:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 13:24:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 13:24:46,385 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-19 13:24:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:46,470 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-19 13:24:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 13:24:46,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 62 [2024-11-19 13:24:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:46,471 INFO L225 Difference]: With dead ends: 111 [2024-11-19 13:24:46,471 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 13:24:46,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 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-19 13:24:46,473 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:46,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 224 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 13:24:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 13:24:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.087378640776699) internal successors, (112), 104 states have internal predecessors, (112), 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-19 13:24:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-19 13:24:46,480 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 62 [2024-11-19 13:24:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:46,480 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-19 13:24:46,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-19 13:24:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-19 13:24:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 13:24:46,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:46,481 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:46,499 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-19 13:24:46,681 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-19 13:24:46,681 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:46,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1421089981, now seen corresponding path program 2 times [2024-11-19 13:24:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:46,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233926196] [2024-11-19 13:24:46,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:46,682 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-19 13:24:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:46,685 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-19 13:24:46,685 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-19 13:24:46,939 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:46,940 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:46,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:46,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 13:24:46,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:46,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233926196] [2024-11-19 13:24:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233926196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:46,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:46,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622085907] [2024-11-19 13:24:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:46,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:46,980 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-19 13:24:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:47,139 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-19 13:24:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:47,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 66 [2024-11-19 13:24:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:47,140 INFO L225 Difference]: With dead ends: 131 [2024-11-19 13:24:47,140 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 13:24:47,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-19 13:24:47,141 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:47,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 13:24:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-19 13:24:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 127 states have internal predecessors, (137), 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-19 13:24:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-19 13:24:47,146 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 66 [2024-11-19 13:24:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:47,147 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-19 13:24:47,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-19 13:24:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-19 13:24:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 13:24:47,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:47,148 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 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-19 13:24:47,158 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 (17)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:47,351 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-19 13:24:47,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:47,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1336424804, now seen corresponding path program 2 times [2024-11-19 13:24:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:47,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39540714] [2024-11-19 13:24:47,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:47,353 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-19 13:24:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:47,356 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-19 13:24:47,356 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-19 13:24:47,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:47,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:47,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 13:24:47,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 13:24:47,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:47,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39540714] [2024-11-19 13:24:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39540714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:24:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942997348] [2024-11-19 13:24:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:47,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:47,701 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-19 13:24:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:47,927 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-11-19 13:24:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 74 [2024-11-19 13:24:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:47,928 INFO L225 Difference]: With dead ends: 170 [2024-11-19 13:24:47,928 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 13:24:47,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 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-19 13:24:47,929 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:47,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 13:24:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-19 13:24:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0793650793650793) internal successors, (136), 127 states have internal predecessors, (136), 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-19 13:24:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-19 13:24:47,934 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 74 [2024-11-19 13:24:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-19 13:24:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-19 13:24:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-19 13:24:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 13:24:47,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:47,935 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:47,945 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:48,135 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-19 13:24:48,136 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1905935110, now seen corresponding path program 1 times [2024-11-19 13:24:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919334287] [2024-11-19 13:24:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:48,137 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-19 13:24:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:48,140 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-19 13:24:48,140 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-19 13:24:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:48,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 13:24:48,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-19 13:24:48,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-19 13:24:48,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919334287] [2024-11-19 13:24:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919334287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:48,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:48,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 13:24:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318884060] [2024-11-19 13:24:48,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 13:24:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 13:24:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-19 13:24:48,805 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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-19 13:24:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:49,368 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2024-11-19 13:24:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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 89 [2024-11-19 13:24:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:49,369 INFO L225 Difference]: With dead ends: 221 [2024-11-19 13:24:49,369 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 13:24:49,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-19 13:24:49,370 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:49,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 356 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 13:24:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 13:24:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 13:24:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 151 states have internal predecessors, (160), 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-19 13:24:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2024-11-19 13:24:49,379 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 89 [2024-11-19 13:24:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2024-11-19 13:24:49,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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-19 13:24:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2024-11-19 13:24:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 13:24:49,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:49,380 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-19 13:24:49,395 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-19 13:24:49,581 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-19 13:24:49,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:49,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash -726455591, now seen corresponding path program 1 times [2024-11-19 13:24:49,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411828142] [2024-11-19 13:24:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:49,583 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-19 13:24:49,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:49,585 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-19 13:24:49,587 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-19 13:24:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:50,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 13:24:50,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:50,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:50,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411828142] [2024-11-19 13:24:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411828142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:50,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 13:24:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250000514] [2024-11-19 13:24:50,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:50,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 13:24:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:50,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 13:24:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-19 13:24:50,366 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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-19 13:24:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:50,732 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2024-11-19 13:24:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 13:24:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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 109 [2024-11-19 13:24:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:50,733 INFO L225 Difference]: With dead ends: 182 [2024-11-19 13:24:50,733 INFO L226 Difference]: Without dead ends: 178 [2024-11-19 13:24:50,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-19 13:24:50,734 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:50,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 356 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-19 13:24:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-19 13:24:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.0574712643678161) internal successors, (184), 175 states have internal predecessors, (184), 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-19 13:24:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 186 transitions. [2024-11-19 13:24:50,740 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 186 transitions. Word has length 109 [2024-11-19 13:24:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:50,741 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 186 transitions. [2024-11-19 13:24:50,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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-19 13:24:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 186 transitions. [2024-11-19 13:24:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 13:24:50,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:50,742 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:50,756 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-19 13:24:50,947 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-19 13:24:50,947 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 2 times [2024-11-19 13:24:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815229381] [2024-11-19 13:24:50,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:50,949 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-19 13:24:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:50,951 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-19 13:24:50,952 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-19 13:24:51,321 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:51,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:51,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 13:24:51,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-19 13:24:51,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-19 13:24:51,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815229381] [2024-11-19 13:24:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815229381] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-19 13:24:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377609361] [2024-11-19 13:24:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:51,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:51,691 INFO L87 Difference]: Start difference. First operand 178 states and 186 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-19 13:24:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:51,764 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2024-11-19 13:24:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 113 [2024-11-19 13:24:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:51,765 INFO L225 Difference]: With dead ends: 178 [2024-11-19 13:24:51,765 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 13:24:51,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:51,766 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:51,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 13:24:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2024-11-19 13:24:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 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-19 13:24:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-19 13:24:51,772 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 113 [2024-11-19 13:24:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:51,772 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-19 13:24:51,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-19 13:24:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-19 13:24:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 13:24:51,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:51,773 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 10, 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, 1] [2024-11-19 13:24:51,784 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-19 13:24:51,973 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-19 13:24:51,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:51,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2140533721, now seen corresponding path program 2 times [2024-11-19 13:24:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875428021] [2024-11-19 13:24:51,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:51,975 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-19 13:24:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:51,978 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-19 13:24:51,978 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-19 13:24:55,856 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:55,856 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:55,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 13:24:55,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:56,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 13:24:56,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:56,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875428021] [2024-11-19 13:24:56,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875428021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:56,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-19 13:24:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466844255] [2024-11-19 13:24:56,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 13:24:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 13:24:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-19 13:24:56,506 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-19 13:24:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:58,166 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2024-11-19 13:24:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 13:24:58,166 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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 133 [2024-11-19 13:24:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:58,167 INFO L225 Difference]: With dead ends: 195 [2024-11-19 13:24:58,167 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 13:24:58,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 13:24:58,168 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:58,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 821 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 13:24:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 13:24:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-19 13:24:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 1.0425531914893618) internal successors, (196), 188 states have internal predecessors, (196), 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-19 13:24:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2024-11-19 13:24:58,176 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 133 [2024-11-19 13:24:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:58,176 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2024-11-19 13:24:58,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-19 13:24:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2024-11-19 13:24:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 13:24:58,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:58,178 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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, 1] [2024-11-19 13:24:58,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-19 13:24:58,378 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-19 13:24:58,378 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-19 13:24:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1178958375, now seen corresponding path program 3 times [2024-11-19 13:24:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822964784] [2024-11-19 13:24:58,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 13:24:58,380 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-19 13:24:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:58,382 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-19 13:24:58,383 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