./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:49:06,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:49:06,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 19:49:06,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:49:06,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:49:06,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:49:06,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:49:06,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:49:06,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:49:06,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:49:06,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:49:06,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:49:06,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:49:06,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:49:06,584 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:49:06,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:49:06,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:49:06,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:49:06,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:49:06,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:49:06,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:49:06,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:49:06,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:49:06,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:49:06,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:49:06,589 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:49:06,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:49:06,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:49:06,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:49:06,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:49:06,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:49:06,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:49:06,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:49:06,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:49:06,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:49:06,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:49:06,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:49:06,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:49:06,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:49:06,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:49:06,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:49:06,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:49:06,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:49:06,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:49:06,595 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-10-24 19:49:06,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:49:06,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:49:06,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:49:06,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:49:06,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:49:06,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-24 19:49:08,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:49:08,648 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:49:08,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-24 19:49:08,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc825aa0/cc064a8135dc414b8ea883db437545a7/FLAG04d9e6ecc [2024-10-24 19:49:08,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc825aa0/cc064a8135dc414b8ea883db437545a7 [2024-10-24 19:49:08,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:49:08,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:49:08,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:49:08,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:49:08,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:49:08,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:49:08" (1/1) ... [2024-10-24 19:49:08,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764ff56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:08, skipping insertion in model container [2024-10-24 19:49:08,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:49:08" (1/1) ... [2024-10-24 19:49:08,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:49:09,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:49:09,061 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:49:09,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:49:09,166 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:49:09,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09 WrapperNode [2024-10-24 19:49:09,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:49:09,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:49:09,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:49:09,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:49:09,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,225 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 351 [2024-10-24 19:49:09,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:49:09,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:49:09,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:49:09,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:49:09,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,287 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-10-24 19:49:09,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:49:09,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:49:09,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:49:09,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:49:09,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (1/1) ... [2024-10-24 19:49:09,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:49:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:09,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:49:09,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:49:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 19:49:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 19:49:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 19:49:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 19:49:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 19:49:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 19:49:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 19:49:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:49:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 19:49:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 19:49:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:49:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:49:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-24 19:49:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-24 19:49:09,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:49:09,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:49:09,932 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-10-24 19:49:09,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:49:09,973 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:49:09,977 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-24 19:49:09,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:49:09 BoogieIcfgContainer [2024-10-24 19:49:09,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:49:09,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:49:09,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:49:09,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:49:09,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:49:08" (1/3) ... [2024-10-24 19:49:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78554814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:49:09, skipping insertion in model container [2024-10-24 19:49:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:49:09" (2/3) ... [2024-10-24 19:49:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78554814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:49:09, skipping insertion in model container [2024-10-24 19:49:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:49:09" (3/3) ... [2024-10-24 19:49:09,988 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-10-24 19:49:10,004 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:49:10,006 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 19:49:10,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:49:10,072 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;@2cb58262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:49:10,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 19:49:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 58 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 19:49:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 19:49:10,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:10,089 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:10,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1896225196, now seen corresponding path program 1 times [2024-10-24 19:49:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099525743] [2024-10-24 19:49:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 19:49:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 19:49:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 19:49:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 19:49:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 19:49:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 19:49:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:49:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 19:49:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 19:49:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:10,988 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-24 19:49:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099525743] [2024-10-24 19:49:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099525743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:10,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:10,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:49:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147494135] [2024-10-24 19:49:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:49:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:49:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:49:11,021 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 58 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 19:49:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:11,156 INFO L93 Difference]: Finished difference Result 145 states and 239 transitions. [2024-10-24 19:49:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:49:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-24 19:49:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:11,167 INFO L225 Difference]: With dead ends: 145 [2024-10-24 19:49:11,168 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 19:49:11,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:49:11,176 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:11,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 19:49:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 19:49:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.5) internal successors, (75), 55 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 19:49:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-10-24 19:49:11,229 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 81 [2024-10-24 19:49:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-10-24 19:49:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 19:49:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-10-24 19:49:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 19:49:11,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:11,235 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:49:11,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 616565047, now seen corresponding path program 1 times [2024-10-24 19:49:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082331603] [2024-10-24 19:49:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-24 19:49:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082331603] [2024-10-24 19:49:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082331603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953420628] [2024-10-24 19:49:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:13,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:49:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 19:49:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:13,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:49:13,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-24 19:49:13,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:49:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953420628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:13,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:49:13,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-24 19:49:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728346837] [2024-10-24 19:49:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:13,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:49:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:49:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:49:13,796 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:13,840 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2024-10-24 19:49:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:49:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-24 19:49:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:13,842 INFO L225 Difference]: With dead ends: 71 [2024-10-24 19:49:13,843 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 19:49:13,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:49:13,844 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:13,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:49:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 19:49:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-24 19:49:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.48) internal successors, (74), 54 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 19:49:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-10-24 19:49:13,858 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 119 [2024-10-24 19:49:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-10-24 19:49:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-10-24 19:49:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 19:49:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:13,865 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:13,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:49:14,066 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-10-24 19:49:14,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1933647467, now seen corresponding path program 1 times [2024-10-24 19:49:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:14,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402983771] [2024-10-24 19:49:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-24 19:49:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402983771] [2024-10-24 19:49:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402983771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958890606] [2024-10-24 19:49:15,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:15,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:15,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:49:15,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 19:49:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:16,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 1785 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:49:16,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-24 19:49:16,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:49:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958890606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:49:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-24 19:49:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849150273] [2024-10-24 19:49:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:16,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:49:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:49:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:49:16,189 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:16,235 INFO L93 Difference]: Finished difference Result 92 states and 134 transitions. [2024-10-24 19:49:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:49:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-24 19:49:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:16,238 INFO L225 Difference]: With dead ends: 92 [2024-10-24 19:49:16,239 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 19:49:16,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:49:16,241 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:16,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:49:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 19:49:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-24 19:49:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 57 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 19:49:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-10-24 19:49:16,254 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 120 [2024-10-24 19:49:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-10-24 19:49:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-10-24 19:49:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 19:49:16,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:16,258 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:16,280 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-10-24 19:49:16,459 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,SelfDestructingSolverStorable2 [2024-10-24 19:49:16,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:16,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1190631033, now seen corresponding path program 1 times [2024-10-24 19:49:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522744378] [2024-10-24 19:49:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 19:49:17,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522744378] [2024-10-24 19:49:17,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522744378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974588768] [2024-10-24 19:49:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:17,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:17,792 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-10-24 19:49:17,794 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-10-24 19:49:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:18,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 1799 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:49:18,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-24 19:49:18,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:49:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-24 19:49:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974588768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:49:18,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:49:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-10-24 19:49:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727382137] [2024-10-24 19:49:18,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:49:18,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 19:49:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 19:49:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-24 19:49:18,765 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-24 19:49:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:19,676 INFO L93 Difference]: Finished difference Result 185 states and 325 transitions. [2024-10-24 19:49:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 19:49:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 123 [2024-10-24 19:49:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:19,680 INFO L225 Difference]: With dead ends: 185 [2024-10-24 19:49:19,682 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 19:49:19,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-10-24 19:49:19,685 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:19,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 767 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 19:49:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 19:49:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-10-24 19:49:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.408450704225352) internal successors, (100), 77 states have internal predecessors, (100), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 175 transitions. [2024-10-24 19:49:19,723 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 175 transitions. Word has length 123 [2024-10-24 19:49:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 175 transitions. [2024-10-24 19:49:19,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-24 19:49:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2024-10-24 19:49:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 19:49:19,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:19,726 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:19,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 19:49:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:19,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1641488542, now seen corresponding path program 1 times [2024-10-24 19:49:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890786347] [2024-10-24 19:49:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-24 19:49:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890786347] [2024-10-24 19:49:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890786347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:49:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879442119] [2024-10-24 19:49:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:20,555 INFO L87 Difference]: Start difference. First operand 106 states and 175 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:20,638 INFO L93 Difference]: Finished difference Result 111 states and 180 transitions. [2024-10-24 19:49:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:49:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-10-24 19:49:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:20,642 INFO L225 Difference]: With dead ends: 111 [2024-10-24 19:49:20,642 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 19:49:20,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:20,643 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:20,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 19:49:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 19:49:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 80 states have internal predecessors, (103), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 178 transitions. [2024-10-24 19:49:20,663 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 178 transitions. Word has length 139 [2024-10-24 19:49:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 178 transitions. [2024-10-24 19:49:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 178 transitions. [2024-10-24 19:49:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 19:49:20,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:20,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:20,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:49:20,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 912738875, now seen corresponding path program 1 times [2024-10-24 19:49:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723901853] [2024-10-24 19:49:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-24 19:49:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723901853] [2024-10-24 19:49:21,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723901853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:21,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:21,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:49:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949554091] [2024-10-24 19:49:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:21,203 INFO L87 Difference]: Start difference. First operand 109 states and 178 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:21,279 INFO L93 Difference]: Finished difference Result 133 states and 209 transitions. [2024-10-24 19:49:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:49:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-24 19:49:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:21,281 INFO L225 Difference]: With dead ends: 133 [2024-10-24 19:49:21,282 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 19:49:21,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:21,283 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:21,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 19:49:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 19:49:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.381578947368421) internal successors, (105), 82 states have internal predecessors, (105), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 180 transitions. [2024-10-24 19:49:21,303 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 180 transitions. Word has length 142 [2024-10-24 19:49:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 180 transitions. [2024-10-24 19:49:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 180 transitions. [2024-10-24 19:49:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 19:49:21,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:21,307 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:21,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:49:21,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:21,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -367124803, now seen corresponding path program 1 times [2024-10-24 19:49:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593957322] [2024-10-24 19:49:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-24 19:49:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593957322] [2024-10-24 19:49:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593957322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:49:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599781126] [2024-10-24 19:49:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:21,873 INFO L87 Difference]: Start difference. First operand 111 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:21,960 INFO L93 Difference]: Finished difference Result 137 states and 213 transitions. [2024-10-24 19:49:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:49:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-24 19:49:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:21,963 INFO L225 Difference]: With dead ends: 137 [2024-10-24 19:49:21,963 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 19:49:21,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:21,965 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:21,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 19:49:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-24 19:49:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 84 states have internal predecessors, (107), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 182 transitions. [2024-10-24 19:49:21,986 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 182 transitions. Word has length 142 [2024-10-24 19:49:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 182 transitions. [2024-10-24 19:49:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 182 transitions. [2024-10-24 19:49:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 19:49:21,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:21,988 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:21,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:49:21,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -953930817, now seen corresponding path program 1 times [2024-10-24 19:49:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858922537] [2024-10-24 19:49:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-24 19:49:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858922537] [2024-10-24 19:49:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858922537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:49:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189322870] [2024-10-24 19:49:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:22,560 INFO L87 Difference]: Start difference. First operand 113 states and 182 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:22,654 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2024-10-24 19:49:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:49:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-24 19:49:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:22,656 INFO L225 Difference]: With dead ends: 141 [2024-10-24 19:49:22,656 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 19:49:22,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:22,658 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:22,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 19:49:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-24 19:49:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3625) internal successors, (109), 86 states have internal predecessors, (109), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2024-10-24 19:49:22,669 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 142 [2024-10-24 19:49:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:22,670 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2024-10-24 19:49:22,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2024-10-24 19:49:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 19:49:22,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:22,674 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:22,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:49:22,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash -252866239, now seen corresponding path program 1 times [2024-10-24 19:49:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854203169] [2024-10-24 19:49:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-24 19:49:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854203169] [2024-10-24 19:49:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854203169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:23,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:49:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300204591] [2024-10-24 19:49:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:23,202 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:23,278 INFO L93 Difference]: Finished difference Result 145 states and 221 transitions. [2024-10-24 19:49:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:49:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-24 19:49:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:23,280 INFO L225 Difference]: With dead ends: 145 [2024-10-24 19:49:23,280 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 19:49:23,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:49:23,281 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:23,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 19:49:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 19:49:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.353658536585366) internal successors, (111), 88 states have internal predecessors, (111), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 186 transitions. [2024-10-24 19:49:23,295 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 186 transitions. Word has length 142 [2024-10-24 19:49:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:23,296 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 186 transitions. [2024-10-24 19:49:23,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 186 transitions. [2024-10-24 19:49:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 19:49:23,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:23,299 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:49:23,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 427192131, now seen corresponding path program 1 times [2024-10-24 19:49:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616627047] [2024-10-24 19:49:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616627047] [2024-10-24 19:49:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616627047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513271197] [2024-10-24 19:49:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:23,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:23,931 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-10-24 19:49:23,933 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-10-24 19:49:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:24,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 1812 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:49:24,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:24,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:49:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513271197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:49:25,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:49:25,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-24 19:49:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921275820] [2024-10-24 19:49:25,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:49:25,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 19:49:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 19:49:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 19:49:25,051 INFO L87 Difference]: Start difference. First operand 117 states and 186 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:25,177 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-10-24 19:49:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:49:25,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-24 19:49:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:25,180 INFO L225 Difference]: With dead ends: 155 [2024-10-24 19:49:25,180 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 19:49:25,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 19:49:25,181 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:25,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 19:49:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-24 19:49:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2024-10-24 19:49:25,192 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 142 [2024-10-24 19:49:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2024-10-24 19:49:25,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-10-24 19:49:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 19:49:25,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:25,194 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:25,217 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-10-24 19:49:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:25,399 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1625059787, now seen corresponding path program 2 times [2024-10-24 19:49:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527138136] [2024-10-24 19:49:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:26,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527138136] [2024-10-24 19:49:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527138136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528968424] [2024-10-24 19:49:26,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:49:26,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:26,318 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-10-24 19:49:26,320 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-10-24 19:49:27,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:49:27,145 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:49:27,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:49:27,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-10-24 19:49:27,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:49:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528968424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:49:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2024-10-24 19:49:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329997347] [2024-10-24 19:49:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:49:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:49:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:49:27,194 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:27,226 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2024-10-24 19:49:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:49:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 151 [2024-10-24 19:49:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:27,228 INFO L225 Difference]: With dead ends: 137 [2024-10-24 19:49:27,228 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 19:49:27,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:49:27,229 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:27,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:49:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 19:49:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-24 19:49:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 99 states have internal predecessors, (122), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 197 transitions. [2024-10-24 19:49:27,239 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 197 transitions. Word has length 151 [2024-10-24 19:49:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:27,240 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 197 transitions. [2024-10-24 19:49:27,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 197 transitions. [2024-10-24 19:49:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 19:49:27,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:27,242 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:27,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 19:49:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 19:49:27,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 448834859, now seen corresponding path program 1 times [2024-10-24 19:49:27,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961825152] [2024-10-24 19:49:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961825152] [2024-10-24 19:49:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961825152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816417370] [2024-10-24 19:49:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:28,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:28,285 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-10-24 19:49:28,288 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-10-24 19:49:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:29,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:49:29,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:29,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:49:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-24 19:49:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816417370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:49:29,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:49:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2024-10-24 19:49:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713199941] [2024-10-24 19:49:29,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:49:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:49:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:49:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:49:29,644 INFO L87 Difference]: Start difference. First operand 128 states and 197 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:29,780 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2024-10-24 19:49:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 19:49:29,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 151 [2024-10-24 19:49:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:29,782 INFO L225 Difference]: With dead ends: 162 [2024-10-24 19:49:29,782 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 19:49:29,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 318 SyntacticMatches, 11 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:49:29,783 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:29,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 19:49:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-24 19:49:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 102 states have internal predecessors, (125), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2024-10-24 19:49:29,791 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 151 [2024-10-24 19:49:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:29,792 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2024-10-24 19:49:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2024-10-24 19:49:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 19:49:29,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:29,794 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:29,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 19:49:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:29,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -114093127, now seen corresponding path program 2 times [2024-10-24 19:49:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882180872] [2024-10-24 19:49:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-24 19:49:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:30,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882180872] [2024-10-24 19:49:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882180872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:49:30,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546225094] [2024-10-24 19:49:30,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:49:30,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:30,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:49:30,580 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-10-24 19:49:30,581 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-10-24 19:49:31,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:49:31,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:49:31,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:49:31,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:49:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-24 19:49:32,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:49:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546225094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:32,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:49:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 19:49:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998365871] [2024-10-24 19:49:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:49:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:49:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:49:32,012 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:32,046 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-24 19:49:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:49:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 154 [2024-10-24 19:49:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:32,048 INFO L225 Difference]: With dead ends: 131 [2024-10-24 19:49:32,048 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 19:49:32,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:49:32,048 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:32,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:49:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 19:49:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 19:49:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 101 states have internal predecessors, (124), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-24 19:49:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-24 19:49:32,059 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 154 [2024-10-24 19:49:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-24 19:49:32,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-24 19:49:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 19:49:32,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:49:32,065 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:32,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 19:49:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:49:32,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 19:49:32,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:49:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 758080620, now seen corresponding path program 1 times [2024-10-24 19:49:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:49:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825439973] [2024-10-24 19:49:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:49:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:49:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 19:49:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 19:49:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:49:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:49:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:49:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:49:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 19:49:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 19:49:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:49:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:49:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 19:49:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 19:49:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 19:49:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 19:49:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 19:49:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:49:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-24 19:49:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:49:32,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825439973] [2024-10-24 19:49:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825439973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:49:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:49:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:49:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290003748] [2024-10-24 19:49:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:49:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:49:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:49:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:49:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:49:32,700 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:49:32,778 INFO L93 Difference]: Finished difference Result 130 states and 199 transitions. [2024-10-24 19:49:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:49:32,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 155 [2024-10-24 19:49:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:49:32,780 INFO L225 Difference]: With dead ends: 130 [2024-10-24 19:49:32,780 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 19:49:32,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:49:32,781 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:49:32,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:49:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 19:49:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 19:49:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10-24 19:49:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 19:49:32,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2024-10-24 19:49:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:49:32,782 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 19:49:32,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 19:49:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 19:49:32,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 19:49:32,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 19:49:32,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 19:49:32,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 19:49:32,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 19:49:32,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:49:32,790 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:49:32,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 19:49:32,888 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:49:32,902 WARN L156 FloydHoareUtils]: Requires clause for append contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-24 19:49:32,907 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-24 19:49:32,908 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-24 19:49:32,908 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] [2024-10-24 19:49:32,909 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-24 19:49:32,909 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] [2024-10-24 19:49:32,909 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] [2024-10-24 19:49:32,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:49:32 BoogieIcfgContainer [2024-10-24 19:49:32,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:49:32,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:49:32,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:49:32,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:49:32,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:49:09" (3/4) ... [2024-10-24 19:49:32,915 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 19:49:32,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure append [2024-10-24 19:49:32,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-24 19:49:32,930 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 19:49:32,930 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 19:49:32,931 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 19:49:33,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:49:33,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 19:49:33,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:49:33,048 INFO L158 Benchmark]: Toolchain (without parser) took 24363.67ms. Allocated memory was 192.9MB in the beginning and 710.9MB in the end (delta: 518.0MB). Free memory was 162.6MB in the beginning and 299.4MB in the end (delta: -136.8MB). Peak memory consumption was 381.3MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,049 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 85.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:49:33,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.60ms. Allocated memory is still 192.9MB. Free memory was 162.6MB in the beginning and 140.7MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.96ms. Allocated memory is still 192.9MB. Free memory was 140.7MB in the beginning and 137.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,050 INFO L158 Benchmark]: Boogie Preprocessor took 93.66ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 132.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,050 INFO L158 Benchmark]: RCFGBuilder took 657.34ms. Allocated memory is still 192.9MB. Free memory was 132.3MB in the beginning and 98.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,050 INFO L158 Benchmark]: TraceAbstraction took 22932.53ms. Allocated memory was 192.9MB in the beginning and 710.9MB in the end (delta: 518.0MB). Free memory was 97.7MB in the beginning and 307.8MB in the end (delta: -210.1MB). Peak memory consumption was 307.9MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,051 INFO L158 Benchmark]: Witness Printer took 135.21ms. Allocated memory is still 710.9MB. Free memory was 307.8MB in the beginning and 299.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 19:49:33,052 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.18ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 85.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.60ms. Allocated memory is still 192.9MB. Free memory was 162.6MB in the beginning and 140.7MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.96ms. Allocated memory is still 192.9MB. Free memory was 140.7MB in the beginning and 137.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.66ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 132.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 657.34ms. Allocated memory is still 192.9MB. Free memory was 132.3MB in the beginning and 98.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22932.53ms. Allocated memory was 192.9MB in the beginning and 710.9MB in the end (delta: 518.0MB). Free memory was 97.7MB in the beginning and 307.8MB in the end (delta: -210.1MB). Peak memory consumption was 307.9MB. Max. memory is 16.1GB. * Witness Printer took 135.21ms. Allocated memory is still 710.9MB. Free memory was 307.8MB in the beginning and 299.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] * 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 - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 5279 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4003 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 1276 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1866 GetRequests, 1750 SyntacticMatches, 11 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=12, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2753 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3255 ConstructedInterpolants, 0 QuantifiedInterpolants, 8781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11361 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 12326/12813 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((0 <= counter) && (counter <= 2147483646)) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (0 < (2147483649 + counter)) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-24 19:49:33,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE