./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/hostid.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 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:30:25,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:30:25,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 14:30:25,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:30:25,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:30:25,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:30:25,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:30:25,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:30:25,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:30:25,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:30:25,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:30:25,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:30:25,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:30:25,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:30:25,342 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:30:25,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:30:25,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:30:25,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:30:25,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:30:25,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:30:25,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:30:25,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:30:25,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:30:25,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:25,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:30:25,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:30:25,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:30:25,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:30:25,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:30:25,348 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 -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2024-11-09 14:30:25,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:30:25,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:30:25,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:30:25,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:30:25,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:30:25,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-09 14:30:26,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:30:26,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:30:26,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-09 14:30:27,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c9810c1/27b804b638b5437499833fcf8dcd8197/FLAG87ca3f26f [2024-11-09 14:30:27,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c9810c1/27b804b638b5437499833fcf8dcd8197 [2024-11-09 14:30:27,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:30:27,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:30:27,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:27,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:30:27,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:30:27,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:27" (1/1) ... [2024-11-09 14:30:27,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24310b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:27, skipping insertion in model container [2024-11-09 14:30:27,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:27" (1/1) ... [2024-11-09 14:30:27,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:30:27,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:27,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:30:27,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:28,140 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:30:28,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28 WrapperNode [2024-11-09 14:30:28,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:28,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:28,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:30:28,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:30:28,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,221 INFO L138 Inliner]: procedures = 524, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 498 [2024-11-09 14:30:28,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:28,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:30:28,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:30:28,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:30:28,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,258 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 355, 2, 6, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 355, 0, 0, 0]. The 7 writes are split as follows [0, 1, 0, 2, 2, 2]. [2024-11-09 14:30:28,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:30:28,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:30:28,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:30:28,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:30:28,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (1/1) ... [2024-11-09 14:30:28,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:28,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:28,331 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-09 14:30:28,333 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-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 14:30:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 14:30:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:30:28,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:30:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 14:30:28,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 14:30:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 14:30:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 14:30:28,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:30:28,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:30:28,933 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 14:30:28,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:30:28,943 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:30:28,943 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 14:30:28,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:28 BoogieIcfgContainer [2024-11-09 14:30:28,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:30:28,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:30:28,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:30:28,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:30:28,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:30:27" (1/3) ... [2024-11-09 14:30:28,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aa305f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:28, skipping insertion in model container [2024-11-09 14:30:28,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:28" (2/3) ... [2024-11-09 14:30:28,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aa305f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:28, skipping insertion in model container [2024-11-09 14:30:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:28" (3/3) ... [2024-11-09 14:30:28,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-09 14:30:28,964 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:30:28,964 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 14:30:29,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:30:29,010 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;@6adc9a8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:30:29,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 14:30:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 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-09 14:30:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 14:30:29,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:29,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 14:30:29,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-09 14:30:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736389756] [2024-11-09 14:30:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,430 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-09 14:30:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736389756] [2024-11-09 14:30:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736389756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423061490] [2024-11-09 14:30:29,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:29,455 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 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-09 14:30:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:29,489 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-09 14:30:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:29,491 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-09 14:30:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:29,495 INFO L225 Difference]: With dead ends: 87 [2024-11-09 14:30:29,495 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 14:30:29,497 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-09 14:30:29,501 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 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-09 14:30:29,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 14:30:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 14:30:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-09 14:30:29,524 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2024-11-09 14:30:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:29,524 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-09 14:30:29,525 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-09 14:30:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-09 14:30:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:30:29,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:29,525 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 14:30:29,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:30:29,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:29,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-09 14:30:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554169861] [2024-11-09 14:30:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:29,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,683 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-09 14:30:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554169861] [2024-11-09 14:30:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554169861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618230589] [2024-11-09 14:30:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:29,686 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-09 14:30:29,687 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-09 14:30:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:29,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:29,927 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-09 14:30:29,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:29,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618230589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:29,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 14:30:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963288013] [2024-11-09 14:30:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:29,930 INFO L87 Difference]: Start difference. First operand 42 states and 45 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-09 14:30:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:29,947 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-09 14:30:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:29,948 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-09 14:30:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:29,948 INFO L225 Difference]: With dead ends: 42 [2024-11-09 14:30:29,948 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 14:30:29,949 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-09 14:30:29,949 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 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-09 14:30:29,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 14:30:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 14:30:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 38 states have internal predecessors, (42), 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-09 14:30:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-09 14:30:29,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2024-11-09 14:30:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:29,954 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-09 14:30:29,954 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-09 14:30:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 14:30:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:30:29,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:29,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 14:30:29,968 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-09 14:30:30,155 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-09 14:30:30,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-09 14:30:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130737909] [2024-11-09 14:30:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,242 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-09 14:30:30,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130737909] [2024-11-09 14:30:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130737909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533762338] [2024-11-09 14:30:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:30,245 INFO L87 Difference]: Start difference. First operand 41 states and 44 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-09 14:30:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:30,254 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-09 14:30:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:30,255 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-09 14:30:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:30,255 INFO L225 Difference]: With dead ends: 41 [2024-11-09 14:30:30,255 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 14:30:30,256 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-09 14:30:30,256 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-09 14:30:30,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 14:30:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 14:30:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-09 14:30:30,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 8 [2024-11-09 14:30:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-09 14:30:30,263 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-09 14:30:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-09 14:30:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 14:30:30,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:30,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:30:30,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1247305624, now seen corresponding path program 1 times [2024-11-09 14:30:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539476489] [2024-11-09 14:30:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 14:30:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,394 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-09 14:30:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539476489] [2024-11-09 14:30:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539476489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949317527] [2024-11-09 14:30:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:30,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:30,398 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-09 14:30:30,400 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-09 14:30:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:30,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:30,578 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-09 14:30:30,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949317527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 14:30:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535883609] [2024-11-09 14:30:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:30,580 INFO L87 Difference]: Start difference. First operand 38 states and 41 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-09 14:30:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:30,603 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-09 14:30:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:30,603 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-09 14:30:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:30,604 INFO L225 Difference]: With dead ends: 38 [2024-11-09 14:30:30,604 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 14:30:30,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-09 14:30:30,605 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 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-09 14:30:30,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 14:30:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 14:30:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 33 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-09 14:30:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-09 14:30:30,609 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 13 [2024-11-09 14:30:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-09 14:30:30,610 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-09 14:30:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 14:30:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 14:30:30,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:30,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:30,626 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-09 14:30:30,813 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-09 14:30:30,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:30,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:30,814 INFO L85 PathProgramCache]: Analyzing trace with hash 11768742, now seen corresponding path program 1 times [2024-11-09 14:30:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274475570] [2024-11-09 14:30:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 14:30:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,961 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-09 14:30:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274475570] [2024-11-09 14:30:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274475570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540905946] [2024-11-09 14:30:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:30,971 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-09 14:30:30,980 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-09 14:30:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:31,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:31,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:31,162 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-09 14:30:31,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:31,190 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-09 14:30:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540905946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:31,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:31,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 14:30:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483539768] [2024-11-09 14:30:31,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:31,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:31,195 INFO L87 Difference]: Start difference. First operand 36 states and 39 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-09 14:30:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:31,230 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-09 14:30:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:31,230 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-09 14:30:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:31,231 INFO L225 Difference]: With dead ends: 75 [2024-11-09 14:30:31,231 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 14:30:31,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-09 14:30:31,233 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 131 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-09 14:30:31,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 131 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 14:30:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 14:30:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 42 states have internal predecessors, (46), 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-09 14:30:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-09 14:30:31,240 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2024-11-09 14:30:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:31,240 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-09 14:30:31,240 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-09 14:30:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-09 14:30:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 14:30:31,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:31,241 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:31,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:31,441 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-09 14:30:31,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 765100852, now seen corresponding path program 2 times [2024-11-09 14:30:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22077512] [2024-11-09 14:30:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:30:31,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:31,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22077512] [2024-11-09 14:30:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22077512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:31,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387510002] [2024-11-09 14:30:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:31,662 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-09 14:30:31,663 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-09 14:30:31,824 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:31,824 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:31,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:31,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:31,874 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-09 14:30:31,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387510002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:31,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 14:30:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844121180] [2024-11-09 14:30:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:30:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:30:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:30:31,882 INFO L87 Difference]: Start difference. First operand 45 states and 48 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-09 14:30:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:31,915 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-09 14:30:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:30:31,916 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-09 14:30:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:31,917 INFO L225 Difference]: With dead ends: 45 [2024-11-09 14:30:31,917 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 14:30:31,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:30:31,918 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 84 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-09 14:30:31,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 84 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 14:30:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 14:30:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 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-09 14:30:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-09 14:30:31,923 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2024-11-09 14:30:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:31,924 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-09 14:30:31,924 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-09 14:30:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-09 14:30:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 14:30:31,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:31,925 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-09 14:30:31,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:32,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:32,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:32,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash 702570007, now seen corresponding path program 1 times [2024-11-09 14:30:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517424986] [2024-11-09 14:30:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,286 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-09 14:30:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517424986] [2024-11-09 14:30:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517424986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:32,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:32,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600886956] [2024-11-09 14:30:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:32,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:32,288 INFO L87 Difference]: Start difference. First operand 43 states and 46 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-09 14:30:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:32,303 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 14:30:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:32,303 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-09 14:30:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:32,304 INFO L225 Difference]: With dead ends: 64 [2024-11-09 14:30:32,304 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 14:30:32,304 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-09 14:30:32,305 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 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-09 14:30:32,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 14:30:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 14:30:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 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-09 14:30:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-09 14:30:32,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 28 [2024-11-09 14:30:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-09 14:30:32,308 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-09 14:30:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-09 14:30:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 14:30:32,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:32,310 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:32,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 14:30:32,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 847573913, now seen corresponding path program 1 times [2024-11-09 14:30:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:32,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859776975] [2024-11-09 14:30:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:30:32,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859776975] [2024-11-09 14:30:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859776975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959165504] [2024-11-09 14:30:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:32,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:32,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:32,483 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-09 14:30:32,484 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-09 14:30:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:32,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:30:32,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:30:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959165504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:32,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 14:30:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770199557] [2024-11-09 14:30:32,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 14:30:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:32,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 14:30:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:30:32,748 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-09 14:30:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:32,789 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-09 14:30:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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 31 [2024-11-09 14:30:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:32,791 INFO L225 Difference]: With dead ends: 95 [2024-11-09 14:30:32,792 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 14:30:32,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 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-09 14:30:32,792 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:32,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 14:30:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 14:30:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 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-09 14:30:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-09 14:30:32,799 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 31 [2024-11-09 14:30:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:32,799 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-09 14:30:32,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-09 14:30:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-09 14:30:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 14:30:32,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:32,800 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] [2024-11-09 14:30:32,814 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-09 14:30:33,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:33,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 2 times [2024-11-09 14:30:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:33,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66725538] [2024-11-09 14:30:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,320 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-09 14:30:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:33,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66725538] [2024-11-09 14:30:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66725538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:33,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 14:30:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319136596] [2024-11-09 14:30:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:33,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:33,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:33,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:33,322 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-09 14:30:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:33,365 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-09 14:30:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 49 [2024-11-09 14:30:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:33,367 INFO L225 Difference]: With dead ends: 85 [2024-11-09 14:30:33,367 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 14:30:33,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:33,367 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:33,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 14:30:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-09 14:30:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.164179104477612) internal successors, (78), 71 states have internal predecessors, (78), 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-09 14:30:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-09 14:30:33,372 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 49 [2024-11-09 14:30:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-09 14:30:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-09 14:30:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-09 14:30:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 14:30:33,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:33,373 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] [2024-11-09 14:30:33,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 14:30:33,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1631027293, now seen corresponding path program 1 times [2024-11-09 14:30:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:33,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549001205] [2024-11-09 14:30:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:33,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,526 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-09 14:30:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549001205] [2024-11-09 14:30:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549001205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843556854] [2024-11-09 14:30:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:33,530 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-09 14:30:33,531 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-09 14:30:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:33,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:33,779 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-09 14:30:33,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843556854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 14:30:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834170112] [2024-11-09 14:30:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:33,780 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-09 14:30:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:33,799 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-09 14:30:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 49 [2024-11-09 14:30:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:33,800 INFO L225 Difference]: With dead ends: 74 [2024-11-09 14:30:33,800 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 14:30:33,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-09 14:30:33,801 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 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-09 14:30:33,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 14:30:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 14:30:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 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-09 14:30:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-09 14:30:33,805 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 49 [2024-11-09 14:30:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:33,806 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-09 14:30:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-09 14:30:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-09 14:30:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:33,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:33,806 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-09 14:30:33,823 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-09 14:30:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:34,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-09 14:30:34,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25356838] [2024-11-09 14:30:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,143 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-09 14:30:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25356838] [2024-11-09 14:30:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25356838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:34,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:34,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:34,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038040971] [2024-11-09 14:30:34,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:34,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:34,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:34,145 INFO L87 Difference]: Start difference. First operand 73 states and 78 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-09 14:30:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:34,156 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-09 14:30:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:34,156 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-09 14:30:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:34,157 INFO L225 Difference]: With dead ends: 73 [2024-11-09 14:30:34,158 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 14:30:34,158 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-09 14:30:34,158 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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-09 14:30:34,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 14:30:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-09 14:30:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 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-09 14:30:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-09 14:30:34,165 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 50 [2024-11-09 14:30:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-09 14:30:34,165 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-09 14:30:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-09 14:30:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 14:30:34,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:34,166 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] [2024-11-09 14:30:34,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 14:30:34,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1106707312, now seen corresponding path program 1 times [2024-11-09 14:30:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966636065] [2024-11-09 14:30:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:34,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966636065] [2024-11-09 14:30:34,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966636065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:34,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535666809] [2024-11-09 14:30:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:34,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:34,332 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-09 14:30:34,333 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-09 14:30:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:34,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:34,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535666809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:34,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 14:30:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800298754] [2024-11-09 14:30:34,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:34,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:34,595 INFO L87 Difference]: Start difference. First operand 68 states and 72 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-09 14:30:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:34,617 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-09 14:30:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:34,618 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 57 [2024-11-09 14:30:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:34,618 INFO L225 Difference]: With dead ends: 106 [2024-11-09 14:30:34,618 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 14:30:34,618 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-09 14:30:34,619 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 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-09 14:30:34,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 14:30:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 14:30:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 83 states have internal predecessors, (88), 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-09 14:30:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-09 14:30:34,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 57 [2024-11-09 14:30:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-09 14:30:34,626 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-09 14:30:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-09 14:30:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 14:30:34,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:34,630 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] [2024-11-09 14:30:34,647 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-09 14:30:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:34,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:34,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1451339836, now seen corresponding path program 2 times [2024-11-09 14:30:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340127329] [2024-11-09 14:30:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340127329] [2024-11-09 14:30:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340127329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943151258] [2024-11-09 14:30:35,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:35,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:35,050 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-09 14:30:35,051 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-09 14:30:35,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:30:35,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:35,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:35,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:35,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943151258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:35,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 14:30:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674645628] [2024-11-09 14:30:35,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:35,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 14:30:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 14:30:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:30:35,386 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-09 14:30:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:35,434 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-09 14:30:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-09 14:30:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:35,435 INFO L225 Difference]: With dead ends: 151 [2024-11-09 14:30:35,435 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 14:30:35,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 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-09 14:30:35,436 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:35,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 14:30:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 14:30:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0598290598290598) internal successors, (124), 119 states have internal predecessors, (124), 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-09 14:30:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2024-11-09 14:30:35,441 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 66 [2024-11-09 14:30:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:35,441 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2024-11-09 14:30:35,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-09 14:30:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2024-11-09 14:30:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 14:30:35,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:35,442 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] [2024-11-09 14:30:35,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 14:30:35,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 14:30:35,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-09 14:30:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854199920] [2024-11-09 14:30:35,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:30:35,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:30:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:30:35,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 14:30:35,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:30:35,914 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-09 14:30:35,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-09 14:30:35,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-09 14:30:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 14:30:35,920 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:35,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:30:35,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:30:35 BoogieIcfgContainer [2024-11-09 14:30:35,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:30:35,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:30:35,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:30:35,991 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:30:35,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:28" (3/4) ... [2024-11-09 14:30:35,993 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:30:35,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:30:35,994 INFO L158 Benchmark]: Toolchain (without parser) took 8699.15ms. Allocated memory was 169.9MB in the beginning and 287.3MB in the end (delta: 117.4MB). Free memory was 135.7MB in the beginning and 195.5MB in the end (delta: -59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,994 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:30:35,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 847.72ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 109.7MB in the end (delta: 25.3MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.13ms. Allocated memory is still 169.9MB. Free memory was 109.7MB in the beginning and 103.4MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,995 INFO L158 Benchmark]: Boogie Preprocessor took 73.62ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 96.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,996 INFO L158 Benchmark]: RCFGBuilder took 645.35ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 181.5MB in the end (delta: -85.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,996 INFO L158 Benchmark]: TraceAbstraction took 7044.35ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 181.5MB in the beginning and 195.5MB in the end (delta: -14.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-11-09 14:30:35,996 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 287.3MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:30:35,998 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.14ms. Allocated memory is still 130.0MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 847.72ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 109.7MB in the end (delta: 25.3MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.13ms. Allocated memory is still 169.9MB. Free memory was 109.7MB in the beginning and 103.4MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.62ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 96.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 645.35ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 181.5MB in the end (delta: -85.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7044.35ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 181.5MB in the beginning and 195.5MB in the end (delta: -14.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 287.3MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1774]: 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 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 [L1860] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1867] EXPR argc+1 [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] EXPR argc+1 [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 [L1870] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0, mem_track={-13:0}, optind=1] [L1870] 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 -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2024-11-09 14:30:38,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:30:38,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:30:38,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:30:38,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:30:38,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:30:38,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-09 14:30:39,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:30:39,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:30:39,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-09 14:30:39,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21ead6a8/2dbe0472f8394dcfacd40d5646e2cf23/FLAG5dd655356 [2024-11-09 14:30:39,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21ead6a8/2dbe0472f8394dcfacd40d5646e2cf23 [2024-11-09 14:30:39,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:30:39,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:30:39,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:39,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:30:39,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:30:39,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:39" (1/1) ... [2024-11-09 14:30:39,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abc210c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:39, skipping insertion in model container [2024-11-09 14:30:39,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:39" (1/1) ... [2024-11-09 14:30:40,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:30:40,582 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-09 14:30:40,584 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-09 14:30:40,606 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-09 14:30:40,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:40,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:30:40,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:40,820 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:30:40,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40 WrapperNode [2024-11-09 14:30:40,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:40,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:40,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:30:40,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:30:40,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,898 INFO L138 Inliner]: procedures = 531, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 491 [2024-11-09 14:30:40,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:40,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:30:40,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:30:40,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:30:40,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,946 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 355, 2, 2, 6, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 355, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 2, 2, 2, 1]. [2024-11-09 14:30:40,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:40,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:41,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:30:41,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:30:41,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:30:41,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:30:41,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (1/1) ... [2024-11-09 14:30:41,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:41,041 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-09 14:30:41,044 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-09 14:30:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:30:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 14:30:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 14:30:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 14:30:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 14:30:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:30:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 14:30:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:30:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 14:30:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 14:30:41,337 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:30:41,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:30:41,750 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-09 14:30:41,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:30:41,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:30:41,761 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 14:30:41,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:41 BoogieIcfgContainer [2024-11-09 14:30:41,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:30:41,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:30:41,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:30:41,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:30:41,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:30:39" (1/3) ... [2024-11-09 14:30:41,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31574734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:41, skipping insertion in model container [2024-11-09 14:30:41,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:40" (2/3) ... [2024-11-09 14:30:41,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31574734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:41, skipping insertion in model container [2024-11-09 14:30:41,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:41" (3/3) ... [2024-11-09 14:30:41,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-09 14:30:41,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:30:41,781 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 14:30:41,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:30:41,837 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;@5887bb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:30:41,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 14:30:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 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-09 14:30:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 14:30:41,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:41,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 14:30:41,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:41,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-09 14:30:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297072717] [2024-11-09 14:30:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:41,865 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-09 14:30:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:41,868 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-09 14:30:41,869 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-09 14:30:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 14:30:42,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:42,133 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-09 14:30:42,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:42,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297072717] [2024-11-09 14:30:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297072717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:42,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 14:30:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135984797] [2024-11-09 14:30:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:42,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:30:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:30:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:30:42,158 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 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-09 14:30:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:42,174 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-09 14:30:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:30:42,175 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-09 14:30:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:42,181 INFO L225 Difference]: With dead ends: 78 [2024-11-09 14:30:42,181 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 14:30:42,184 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-09 14:30:42,188 INFO L432 NwaCegarLoop]: 37 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, 37 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-09 14:30:42,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 14:30:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 14:30:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 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-09 14:30:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-09 14:30:42,220 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-09 14:30:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:42,220 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-09 14:30:42,220 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-09 14:30:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-09 14:30:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 14:30:42,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:42,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 14:30:42,244 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-09 14:30:42,421 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-09 14:30:42,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-09 14:30:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438620348] [2024-11-09 14:30:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:42,423 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-09 14:30:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:42,426 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-09 14:30:42,427 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-09 14:30:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:42,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:42,630 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-09 14:30:42,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:42,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438620348] [2024-11-09 14:30:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438620348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:42,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120284875] [2024-11-09 14:30:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:42,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:42,633 INFO L87 Difference]: Start difference. First operand 34 states and 37 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-09 14:30:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:42,657 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-09 14:30:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:42,658 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-09 14:30:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:42,659 INFO L225 Difference]: With dead ends: 66 [2024-11-09 14:30:42,659 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 14:30:42,659 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-09 14:30:42,660 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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-09 14:30:42,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 14:30:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 14:30:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 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-09 14:30:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 14:30:42,666 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2024-11-09 14:30:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:42,666 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 14:30:42,666 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-09 14:30:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 14:30:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:30:42,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:42,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 14:30:42,675 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-09 14:30:42,870 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-09 14:30:42,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:42,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-09 14:30:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977392733] [2024-11-09 14:30:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:42,873 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-09 14:30:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:42,876 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-09 14:30:42,876 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-09 14:30:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:43,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:43,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:43,078 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-09 14:30:43,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:43,110 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-09 14:30:43,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977392733] [2024-11-09 14:30:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977392733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:43,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 14:30:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443311717] [2024-11-09 14:30:43,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:43,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:43,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:43,114 INFO L87 Difference]: Start difference. First operand 37 states and 40 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-09 14:30:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:43,180 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-09 14:30:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:43,181 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-09 14:30:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:43,182 INFO L225 Difference]: With dead ends: 69 [2024-11-09 14:30:43,182 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 14:30:43,183 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-09 14:30:43,183 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:43,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 14:30:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-09 14:30:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 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-09 14:30:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 14:30:43,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2024-11-09 14:30:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:43,191 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 14:30:43,191 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-09 14:30:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 14:30:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 14:30:43,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:43,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:43,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 (4)] Ended with exit code 0 [2024-11-09 14:30:43,393 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-09 14:30:43,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1497124748, now seen corresponding path program 1 times [2024-11-09 14:30:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957146463] [2024-11-09 14:30:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:43,396 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-09 14:30:43,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:43,398 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-09 14:30:43,399 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-09 14:30:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:43,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:30:43,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:43,609 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-09 14:30:43,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:43,667 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-09 14:30:43,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957146463] [2024-11-09 14:30:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957146463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:43,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 14:30:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737934523] [2024-11-09 14:30:43,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:30:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:30:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:30:43,672 INFO L87 Difference]: Start difference. First operand 37 states and 40 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-09 14:30:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:43,777 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-09 14:30:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:30:43,778 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-09 14:30:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:43,778 INFO L225 Difference]: With dead ends: 77 [2024-11-09 14:30:43,778 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 14:30:43,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-09 14:30:43,780 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:43,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 14:30:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 14:30:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 46 states have internal predecessors, (50), 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-09 14:30:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-09 14:30:43,785 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2024-11-09 14:30:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:43,786 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-09 14:30:43,786 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-09 14:30:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-09 14:30:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 14:30:43,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:43,787 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:43,796 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-09 14:30:43,987 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-09 14:30:43,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1161315828, now seen corresponding path program 2 times [2024-11-09 14:30:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831410694] [2024-11-09 14:30:43,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:43,989 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-09 14:30:43,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:43,991 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-09 14:30:43,992 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-09 14:30:44,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:44,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:44,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:30:44,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:44,191 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-09 14:30:44,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:44,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831410694] [2024-11-09 14:30:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831410694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:30:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313090973] [2024-11-09 14:30:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:30:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:30:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:44,193 INFO L87 Difference]: Start difference. First operand 49 states and 52 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-09 14:30:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:44,429 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-09 14:30:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:30:44,430 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-09 14:30:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:44,431 INFO L225 Difference]: With dead ends: 49 [2024-11-09 14:30:44,431 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 14:30:44,431 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-09 14:30:44,432 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:44,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:30:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 14:30:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 14:30:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-09 14:30:44,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 29 [2024-11-09 14:30:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:44,436 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-09 14:30:44,436 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-09 14:30:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-09 14:30:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 14:30:44,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:44,437 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-09 14:30:44,445 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:44,637 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-09 14:30:44,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1704728544, now seen corresponding path program 1 times [2024-11-09 14:30:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772563748] [2024-11-09 14:30:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:44,639 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-09 14:30:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:44,640 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-09 14:30:44,641 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-09 14:30:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:44,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:30:44,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:44,974 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-09 14:30:44,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:45,118 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-09 14:30:45,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:45,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772563748] [2024-11-09 14:30:45,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772563748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:45,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:45,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 14:30:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724120701] [2024-11-09 14:30:45,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:45,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 14:30:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:45,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 14:30:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:30:45,122 INFO L87 Difference]: Start difference. First operand 47 states and 50 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-09 14:30:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:45,355 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-09 14:30:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:45,358 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-09 14:30:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:45,358 INFO L225 Difference]: With dead ends: 85 [2024-11-09 14:30:45,358 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 14:30:45,359 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-09 14:30:45,359 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:45,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 227 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:30:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 14:30:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 14:30:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-09 14:30:45,364 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 35 [2024-11-09 14:30:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-09 14:30:45,365 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-09 14:30:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-09 14:30:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 14:30:45,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:45,366 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-09 14:30:45,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 14:30:45,566 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-09 14:30:45,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash -819573408, now seen corresponding path program 2 times [2024-11-09 14:30:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632482328] [2024-11-09 14:30:45,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:45,568 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-09 14:30:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:45,569 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-09 14:30:45,569 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-09 14:30:45,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:45,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:45,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:45,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:45,788 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-09 14:30:45,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:45,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632482328] [2024-11-09 14:30:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632482328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303998251] [2024-11-09 14:30:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:45,789 INFO L87 Difference]: Start difference. First operand 59 states and 62 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-09 14:30:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:45,816 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-09 14:30:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:45,818 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-09 14:30:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:45,819 INFO L225 Difference]: With dead ends: 78 [2024-11-09 14:30:45,819 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 14:30:45,819 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-09 14:30:45,819 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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-09 14:30:45,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 14:30:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 14:30:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.105263157894737) internal successors, (63), 59 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-09 14:30:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-09 14:30:45,827 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2024-11-09 14:30:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:45,827 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-09 14:30:45,827 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-09 14:30:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-09 14:30:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 14:30:45,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:45,828 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] [2024-11-09 14:30:45,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 14:30:46,028 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-09 14:30:46,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 1 times [2024-11-09 14:30:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491042139] [2024-11-09 14:30:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:46,030 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-09 14:30:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:46,031 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-09 14:30:46,032 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-09 14:30:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:46,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:30:46,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:46,312 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-09 14:30:46,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:46,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491042139] [2024-11-09 14:30:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491042139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:46,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:46,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 14:30:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050833002] [2024-11-09 14:30:46,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:46,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:46,313 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-09 14:30:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:46,563 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-09 14:30:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 49 [2024-11-09 14:30:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:46,564 INFO L225 Difference]: With dead ends: 81 [2024-11-09 14:30:46,564 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 14:30:46,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-09 14:30:46,565 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:46,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:30:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 14:30:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-09 14:30:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 69 states have internal predecessors, (75), 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-09 14:30:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-09 14:30:46,572 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 49 [2024-11-09 14:30:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:46,572 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-09 14:30:46,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-09 14:30:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-09 14:30:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:46,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:46,575 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-09 14:30:46,585 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-09 14:30:46,775 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-09 14:30:46,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-09 14:30:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685053478] [2024-11-09 14:30:46,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:46,777 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-09 14:30:46,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:46,778 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-09 14:30:46,779 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-09 14:30:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:47,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:47,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:47,080 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-09 14:30:47,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:47,117 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-09 14:30:47,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685053478] [2024-11-09 14:30:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685053478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:47,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 14:30:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575413266] [2024-11-09 14:30:47,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:47,119 INFO L87 Difference]: Start difference. First operand 72 states and 77 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-09 14:30:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:47,230 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-09 14:30:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:47,230 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-09 14:30:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:47,231 INFO L225 Difference]: With dead ends: 101 [2024-11-09 14:30:47,231 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 14:30:47,231 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-09 14:30:47,232 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:47,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 14:30:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-09 14:30:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 70 states have internal predecessors, (75), 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-09 14:30:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-09 14:30:47,238 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 50 [2024-11-09 14:30:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:47,238 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-09 14:30:47,238 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-09 14:30:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-09 14:30:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 14:30:47,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:47,240 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] [2024-11-09 14:30:47,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:47,440 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-09 14:30:47,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:47,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash -67955900, now seen corresponding path program 1 times [2024-11-09 14:30:47,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806003590] [2024-11-09 14:30:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:30:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:47,444 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-09 14:30:47,445 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-09 14:30:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:47,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:30:47,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:47,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:47,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806003590] [2024-11-09 14:30:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806003590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:47,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 14:30:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070512689] [2024-11-09 14:30:47,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:47,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:30:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:30:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:30:47,782 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:48,013 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2024-11-09 14:30:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:30:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-11-09 14:30:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:48,017 INFO L225 Difference]: With dead ends: 119 [2024-11-09 14:30:48,017 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 14:30:48,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 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-09 14:30:48,018 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:48,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:30:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 14:30:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 14:30:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.064516129032258) internal successors, (99), 94 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-09 14:30:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-09 14:30:48,033 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 60 [2024-11-09 14:30:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:48,033 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-09 14:30:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:30:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-09 14:30:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 14:30:48,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:48,035 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] [2024-11-09 14:30:48,048 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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:48,236 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-09 14:30:48,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash 734669892, now seen corresponding path program 2 times [2024-11-09 14:30:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771889136] [2024-11-09 14:30:48,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:48,238 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-09 14:30:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:48,239 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-09 14:30:48,239 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-09 14:30:51,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:30:51,263 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:51,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:30:51,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:51,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 14:30:51,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771889136] [2024-11-09 14:30:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771889136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:51,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 14:30:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185004368] [2024-11-09 14:30:51,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 14:30:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 14:30:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:30:51,479 INFO L87 Difference]: Start difference. First operand 97 states and 101 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-09 14:30:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:52,066 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-09 14:30:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:52,068 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 72 [2024-11-09 14:30:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:52,069 INFO L225 Difference]: With dead ends: 155 [2024-11-09 14:30:52,069 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 14:30:52,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 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-09 14:30:52,070 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:52,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 14:30:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 14:30:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 14:30:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.0512820512820513) internal successors, (123), 118 states have internal predecessors, (123), 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-09 14:30:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2024-11-09 14:30:52,079 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 72 [2024-11-09 14:30:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:52,079 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2024-11-09 14:30:52,080 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-09 14:30:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2024-11-09 14:30:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 14:30:52,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:52,080 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] [2024-11-09 14:30:52,094 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-09 14:30:52,281 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-09 14:30:52,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-09 14:30:52,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-09 14:30:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975275580] [2024-11-09 14:30:52,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 14:30:52,282 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-09 14:30:52,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:52,284 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-09 14:30:52,288 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-09 14:31:06,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 14:31:06,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 14:31:06,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:31:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:31:11,829 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 14:31:11,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:31:11,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-09 14:31:11,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-09 14:31:11,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-09 14:31:11,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-09 14:31:11,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-09 14:31:11,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-09 14:31:11,858 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-09 14:31:12,033 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-09 14:31:12,037 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 14:31:12,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:31:12,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:31:12 BoogieIcfgContainer [2024-11-09 14:31:12,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:31:12,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:31:12,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:31:12,107 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:31:12,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:41" (3/4) ... [2024-11-09 14:31:12,110 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:31:12,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:31:12,111 INFO L158 Benchmark]: Toolchain (without parser) took 32155.96ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 38.5MB in the beginning and 70.5MB in the end (delta: -32.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,111 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 54.5MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:31:12,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.99ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 38.3MB in the beginning and 50.9MB in the end (delta: -12.6MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.50ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 43.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,112 INFO L158 Benchmark]: Boogie Preprocessor took 112.35ms. Allocated memory is still 92.3MB. Free memory was 43.7MB in the beginning and 56.1MB in the end (delta: -12.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,112 INFO L158 Benchmark]: RCFGBuilder took 748.89ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 46.7MB in the end (delta: 9.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,112 INFO L158 Benchmark]: TraceAbstraction took 30343.05ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 46.2MB in the beginning and 70.5MB in the end (delta: -24.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-09 14:31:12,113 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 134.2MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:31:12,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 54.5MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.99ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 38.3MB in the beginning and 50.9MB in the end (delta: -12.6MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.50ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 43.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.35ms. Allocated memory is still 92.3MB. Free memory was 43.7MB in the beginning and 56.1MB in the end (delta: -12.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * RCFGBuilder took 748.89ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 46.7MB in the end (delta: 9.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30343.05ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 46.2MB in the beginning and 70.5MB in the end (delta: -24.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 134.2MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1774]: 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 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 [L1860] int i=0; VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) VAL [a={13:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={13:0}, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={13:0}, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={13:0}, argc=1, dummy_utmp={3:0}, optind=1] [L1867] EXPR argc+1 [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] EXPR argc+1 [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 [L1870] int i=0; VAL [applet_name={13:0}, argc=1, argv={6:0}, dummy_utmp={3:0}, i=0, mem_track={7:0}, optind=1] [L1870] COND TRUE i