./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:20:13,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:20:13,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:20:13,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:20:13,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:20:13,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:20:13,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:20:13,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:20:13,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:20:13,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:20:13,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:20:13,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:20:13,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:20:13,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:20:13,765 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:20:13,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:20:13,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:20:13,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:20:13,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:20:13,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:20:13,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:20:13,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:20:13,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:20:13,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:20:13,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:20:13,775 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:20:13,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:20:13,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:20:13,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:20:13,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:20:13,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:20:13,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:20:13,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:20:13,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:20:13,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:13,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:20:13,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:20:13,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:20:13,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:20:13,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:20:13,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:20:13,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:20:13,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:20:13,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:20:13,781 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-clean/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-clean/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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2024-10-11 21:20:14,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:20:14,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:20:14,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:20:14,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:20:14,051 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:20:14,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:15,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:20:15,752 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:20:15,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:15,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a1cb6ac6/e84fb29032e046a798598a74e3f6fe72/FLAG13779f367 [2024-10-11 21:20:15,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a1cb6ac6/e84fb29032e046a798598a74e3f6fe72 [2024-10-11 21:20:15,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:20:15,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:20:15,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:15,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:20:15,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:20:15,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:15" (1/1) ... [2024-10-11 21:20:15,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7859d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:15, skipping insertion in model container [2024-10-11 21:20:15,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:15" (1/1) ... [2024-10-11 21:20:15,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:20:16,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:16,165 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:20:16,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:16,241 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:20:16,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16 WrapperNode [2024-10-11 21:20:16,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:16,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:16,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:20:16,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:20:16,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,307 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 433 [2024-10-11 21:20:16,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:16,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:20:16,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:20:16,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:20:16,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,346 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:20:16,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:20:16,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:20:16,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:20:16,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:20:16,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (1/1) ... [2024-10-11 21:20:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:16,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:16,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:20:16,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:20:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:20:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-11 21:20:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-11 21:20:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 21:20:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 21:20:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-11 21:20:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-11 21:20:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-11 21:20:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-11 21:20:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-11 21:20:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-11 21:20:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 21:20:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 21:20:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:20:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:20:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:20:16,627 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:20:16,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:20:17,316 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-11 21:20:17,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:20:17,375 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:20:17,375 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 21:20:17,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:17 BoogieIcfgContainer [2024-10-11 21:20:17,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:20:17,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:20:17,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:20:17,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:20:17,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:20:15" (1/3) ... [2024-10-11 21:20:17,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12076cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:17, skipping insertion in model container [2024-10-11 21:20:17,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:16" (2/3) ... [2024-10-11 21:20:17,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12076cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:17, skipping insertion in model container [2024-10-11 21:20:17,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:17" (3/3) ... [2024-10-11 21:20:17,389 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:17,405 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:20:17,406 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 21:20:17,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:20:17,479 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;@715d02f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:20:17,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 21:20:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 149 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 21:20:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 21:20:17,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:17,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:17,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1727366390, now seen corresponding path program 1 times [2024-10-11 21:20:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946472456] [2024-10-11 21:20:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946472456] [2024-10-11 21:20:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946472456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795991092] [2024-10-11 21:20:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:17,856 INFO L87 Difference]: Start difference. First operand has 189 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 149 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:18,023 INFO L93 Difference]: Finished difference Result 398 states and 661 transitions. [2024-10-11 21:20:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 21:20:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:18,035 INFO L225 Difference]: With dead ends: 398 [2024-10-11 21:20:18,036 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 21:20:18,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:18,045 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 37 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:18,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 859 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 21:20:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2024-10-11 21:20:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5827814569536425) internal successors, (239), 162 states have internal predecessors, (239), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 21:20:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 315 transitions. [2024-10-11 21:20:18,096 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 315 transitions. Word has length 10 [2024-10-11 21:20:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 315 transitions. [2024-10-11 21:20:18,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 315 transitions. [2024-10-11 21:20:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 21:20:18,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:18,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:20:18,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:18,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1722530138, now seen corresponding path program 1 times [2024-10-11 21:20:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594948871] [2024-10-11 21:20:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:18,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:20:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594948871] [2024-10-11 21:20:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594948871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838252486] [2024-10-11 21:20:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:18,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:18,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:18,316 INFO L87 Difference]: Start difference. First operand 204 states and 315 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:18,402 INFO L93 Difference]: Finished difference Result 432 states and 676 transitions. [2024-10-11 21:20:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 21:20:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:18,406 INFO L225 Difference]: With dead ends: 432 [2024-10-11 21:20:18,406 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 21:20:18,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11 21:20:18,408 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 19 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:18,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 862 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 21:20:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-10-11 21:20:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 188 states have internal predecessors, (274), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 21:20:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 360 transitions. [2024-10-11 21:20:18,451 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 360 transitions. Word has length 15 [2024-10-11 21:20:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:18,451 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 360 transitions. [2024-10-11 21:20:18,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 360 transitions. [2024-10-11 21:20:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 21:20:18,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:18,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:18,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:20:18,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:18,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1197646064, now seen corresponding path program 1 times [2024-10-11 21:20:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401431077] [2024-10-11 21:20:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:20:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:20:18,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:18,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401431077] [2024-10-11 21:20:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401431077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29346831] [2024-10-11 21:20:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:18,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:18,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:18,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:20:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:20:18,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:20:18,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29346831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:18,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 21:20:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577844399] [2024-10-11 21:20:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:18,880 INFO L87 Difference]: Start difference. First operand 235 states and 360 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:18,937 INFO L93 Difference]: Finished difference Result 239 states and 366 transitions. [2024-10-11 21:20:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 21:20:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:18,941 INFO L225 Difference]: With dead ends: 239 [2024-10-11 21:20:18,942 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 21:20:18,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:18,944 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 19 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:18,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1107 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 21:20:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-10-11 21:20:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 187 states have internal predecessors, (271), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 21:20:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 357 transitions. [2024-10-11 21:20:18,976 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 357 transitions. Word has length 28 [2024-10-11 21:20:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:18,976 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 357 transitions. [2024-10-11 21:20:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 357 transitions. [2024-10-11 21:20:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 21:20:18,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:18,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:20:18,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:20:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:19,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:19,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1527678208, now seen corresponding path program 1 times [2024-10-11 21:20:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586269833] [2024-10-11 21:20:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:20:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586269833] [2024-10-11 21:20:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586269833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840954982] [2024-10-11 21:20:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:19,300 INFO L87 Difference]: Start difference. First operand 234 states and 357 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:19,341 INFO L93 Difference]: Finished difference Result 238 states and 363 transitions. [2024-10-11 21:20:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-11 21:20:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:19,343 INFO L225 Difference]: With dead ends: 238 [2024-10-11 21:20:19,344 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 21:20:19,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11 21:20:19,345 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 18 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:19,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 21:20:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2024-10-11 21:20:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.5359477124183007) internal successors, (235), 162 states have internal predecessors, (235), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 21:20:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 311 transitions. [2024-10-11 21:20:19,364 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 311 transitions. Word has length 29 [2024-10-11 21:20:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:19,364 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 311 transitions. [2024-10-11 21:20:19,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 311 transitions. [2024-10-11 21:20:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 21:20:19,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:19,369 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2024-10-11 21:20:19,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:20:19,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:19,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1480051355, now seen corresponding path program 1 times [2024-10-11 21:20:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348085157] [2024-10-11 21:20:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:20:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:20:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:20:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 21:20:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 21:20:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 21:20:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:19,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348085157] [2024-10-11 21:20:19,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348085157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805912982] [2024-10-11 21:20:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:19,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:19,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:20:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:19,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:20:19,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805912982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 21:20:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257035291] [2024-10-11 21:20:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:19,909 INFO L87 Difference]: Start difference. First operand 204 states and 311 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:19,990 INFO L93 Difference]: Finished difference Result 356 states and 551 transitions. [2024-10-11 21:20:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-10-11 21:20:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:19,996 INFO L225 Difference]: With dead ends: 356 [2024-10-11 21:20:19,996 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 21:20:19,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:19,998 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 10 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:19,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 830 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 21:20:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-11 21:20:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.5379746835443038) internal successors, (243), 168 states have internal predecessors, (243), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 21:20:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 321 transitions. [2024-10-11 21:20:20,015 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 321 transitions. Word has length 90 [2024-10-11 21:20:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,017 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 321 transitions. [2024-10-11 21:20:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 321 transitions. [2024-10-11 21:20:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 21:20:20,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,021 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:20,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:20:20,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:20,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:20,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1420926227, now seen corresponding path program 1 times [2024-10-11 21:20:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368260714] [2024-10-11 21:20:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:20:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 21:20:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:20:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:20:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 21:20:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 21:20:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368260714] [2024-10-11 21:20:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368260714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770093455] [2024-10-11 21:20:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:20,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:20,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:20:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:20,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:20:20,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770093455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 21:20:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608036792] [2024-10-11 21:20:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:20,658 INFO L87 Difference]: Start difference. First operand 211 states and 321 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,733 INFO L93 Difference]: Finished difference Result 370 states and 570 transitions. [2024-10-11 21:20:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2024-10-11 21:20:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,737 INFO L225 Difference]: With dead ends: 370 [2024-10-11 21:20:20,738 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 21:20:20,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:20,740 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 8 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 827 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 21:20:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-11 21:20:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.539877300613497) internal successors, (251), 174 states have internal predecessors, (251), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 21:20:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 331 transitions. [2024-10-11 21:20:20,757 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 331 transitions. Word has length 92 [2024-10-11 21:20:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,757 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 331 transitions. [2024-10-11 21:20:20,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 331 transitions. [2024-10-11 21:20:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 21:20:20,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,760 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:20,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:20:20,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:20,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1325949700, now seen corresponding path program 1 times [2024-10-11 21:20:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18620382] [2024-10-11 21:20:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:20:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 21:20:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 21:20:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 21:20:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18620382] [2024-10-11 21:20:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18620382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072088325] [2024-10-11 21:20:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:21,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:21,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:20:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:21,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 21:20:21,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072088325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 21:20:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104578512] [2024-10-11 21:20:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:21,368 INFO L87 Difference]: Start difference. First operand 218 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,489 INFO L93 Difference]: Finished difference Result 395 states and 620 transitions. [2024-10-11 21:20:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:21,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2024-10-11 21:20:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,492 INFO L225 Difference]: With dead ends: 395 [2024-10-11 21:20:21,492 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 21:20:21,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:21,493 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 39 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 788 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 21:20:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-10-11 21:20:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.5542857142857143) internal successors, (272), 186 states have internal predecessors, (272), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 21:20:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2024-10-11 21:20:21,529 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 93 [2024-10-11 21:20:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,531 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2024-10-11 21:20:21,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2024-10-11 21:20:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 21:20:21,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,536 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:21,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:20:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 21:20:21,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1362590479, now seen corresponding path program 1 times [2024-10-11 21:20:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444363097] [2024-10-11 21:20:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 21:20:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 21:20:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-11 21:20:21,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444363097] [2024-10-11 21:20:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444363097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614652473] [2024-10-11 21:20:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:21,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:21,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:20:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:22,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 21:20:22,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614652473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 21:20:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316404494] [2024-10-11 21:20:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:22,111 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:22,198 INFO L93 Difference]: Finished difference Result 470 states and 732 transitions. [2024-10-11 21:20:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:22,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-10-11 21:20:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:22,201 INFO L225 Difference]: With dead ends: 470 [2024-10-11 21:20:22,202 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 21:20:22,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:22,203 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 21 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:22,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 808 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 21:20:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-11 21:20:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 195 states have (on average 1.5692307692307692) internal successors, (306), 206 states have internal predecessors, (306), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 21:20:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 392 transitions. [2024-10-11 21:20:22,216 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 392 transitions. Word has length 96 [2024-10-11 21:20:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:22,217 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 392 transitions. [2024-10-11 21:20:22,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 392 transitions. [2024-10-11 21:20:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 21:20:22,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:22,219 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:22,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:20:22,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:22,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:22,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -127272433, now seen corresponding path program 1 times [2024-10-11 21:20:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338510079] [2024-10-11 21:20:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 21:20:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 21:20:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338510079] [2024-10-11 21:20:22,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338510079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843842708] [2024-10-11 21:20:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:22,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:22,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:20:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:22,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 21:20:22,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:22,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843842708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:22,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:22,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 21:20:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570421695] [2024-10-11 21:20:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:22,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:22,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:22,804 INFO L87 Difference]: Start difference. First operand 256 states and 392 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:22,879 INFO L93 Difference]: Finished difference Result 514 states and 797 transitions. [2024-10-11 21:20:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 21:20:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:22,883 INFO L225 Difference]: With dead ends: 514 [2024-10-11 21:20:22,883 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 21:20:22,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:22,885 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 19 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:22,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 795 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 21:20:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 21:20:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 222 states have internal predecessors, (332), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 21:20:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 422 transitions. [2024-10-11 21:20:22,904 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 422 transitions. Word has length 98 [2024-10-11 21:20:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:22,905 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 422 transitions. [2024-10-11 21:20:22,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 422 transitions. [2024-10-11 21:20:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 21:20:22,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:22,907 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:22,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:20:23,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 21:20:23,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:23,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1235995795, now seen corresponding path program 1 times [2024-10-11 21:20:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715000743] [2024-10-11 21:20:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:20:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715000743] [2024-10-11 21:20:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715000743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784593005] [2024-10-11 21:20:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:23,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:23,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:20:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:23,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 21:20:23,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784593005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912628446] [2024-10-11 21:20:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:23,503 INFO L87 Difference]: Start difference. First operand 276 states and 422 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:23,547 INFO L93 Difference]: Finished difference Result 284 states and 437 transitions. [2024-10-11 21:20:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-11 21:20:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:23,551 INFO L225 Difference]: With dead ends: 284 [2024-10-11 21:20:23,551 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 21:20:23,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:23,571 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:23,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 817 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 21:20:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-10-11 21:20:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 221 states have internal predecessors, (331), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 21:20:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 421 transitions. [2024-10-11 21:20:23,586 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 421 transitions. Word has length 99 [2024-10-11 21:20:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 421 transitions. [2024-10-11 21:20:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 421 transitions. [2024-10-11 21:20:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 21:20:23,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:23,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:23,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:23,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -338835697, now seen corresponding path program 1 times [2024-10-11 21:20:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422432934] [2024-10-11 21:20:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:20:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422432934] [2024-10-11 21:20:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422432934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818234605] [2024-10-11 21:20:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:23,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:23,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:23,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:20:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:24,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 21:20:24,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818234605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799841497] [2024-10-11 21:20:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:24,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:24,172 INFO L87 Difference]: Start difference. First operand 275 states and 421 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:24,216 INFO L93 Difference]: Finished difference Result 471 states and 725 transitions. [2024-10-11 21:20:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-11 21:20:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:24,219 INFO L225 Difference]: With dead ends: 471 [2024-10-11 21:20:24,219 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 21:20:24,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:24,221 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 11 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 848 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-11 21:20:24,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 848 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 21:20:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-11 21:20:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.5636363636363637) internal successors, (344), 229 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 21:20:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 438 transitions. [2024-10-11 21:20:24,236 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 438 transitions. Word has length 100 [2024-10-11 21:20:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:24,237 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 438 transitions. [2024-10-11 21:20:24,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:20:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 438 transitions. [2024-10-11 21:20:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 21:20:24,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:24,239 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:24,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:20:24,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:20:24,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:24,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -766369247, now seen corresponding path program 1 times [2024-10-11 21:20:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140384488] [2024-10-11 21:20:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:20:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:24,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140384488] [2024-10-11 21:20:24,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140384488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:24,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117928660] [2024-10-11 21:20:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:24,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:24,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:20:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:24,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 21:20:24,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117928660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691999382] [2024-10-11 21:20:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:24,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:24,865 INFO L87 Difference]: Start difference. First operand 285 states and 438 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:24,915 INFO L93 Difference]: Finished difference Result 296 states and 457 transitions. [2024-10-11 21:20:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-10-11 21:20:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:24,918 INFO L225 Difference]: With dead ends: 296 [2024-10-11 21:20:24,919 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 21:20:24,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:24,920 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 10 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:24,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 820 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 21:20:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 286. [2024-10-11 21:20:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 230 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 21:20:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 439 transitions. [2024-10-11 21:20:24,933 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 439 transitions. Word has length 107 [2024-10-11 21:20:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:24,933 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 439 transitions. [2024-10-11 21:20:24,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 439 transitions. [2024-10-11 21:20:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 21:20:24,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:24,935 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:24,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:25,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:25,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:25,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2012357453, now seen corresponding path program 1 times [2024-10-11 21:20:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741294208] [2024-10-11 21:20:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:20:25,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741294208] [2024-10-11 21:20:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741294208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785296615] [2024-10-11 21:20:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:25,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:25,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:20:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:25,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 21:20:25,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785296615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861014158] [2024-10-11 21:20:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:25,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:25,496 INFO L87 Difference]: Start difference. First operand 286 states and 439 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:25,536 INFO L93 Difference]: Finished difference Result 288 states and 441 transitions. [2024-10-11 21:20:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:25,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 21:20:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:25,539 INFO L225 Difference]: With dead ends: 288 [2024-10-11 21:20:25,539 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 21:20:25,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:25,541 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 9 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:25,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 846 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 21:20:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-11 21:20:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 231 states have internal predecessors, (346), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 21:20:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-10-11 21:20:25,554 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 108 [2024-10-11 21:20:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:25,555 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-10-11 21:20:25,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-10-11 21:20:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 21:20:25,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:25,557 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:25,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:25,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:20:25,762 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:25,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -976720667, now seen corresponding path program 1 times [2024-10-11 21:20:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593227136] [2024-10-11 21:20:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:20:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593227136] [2024-10-11 21:20:25,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593227136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27771549] [2024-10-11 21:20:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:25,961 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:25,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:20:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:20:26,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 21:20:26,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:26,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27771549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:26,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:26,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 21:20:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681537511] [2024-10-11 21:20:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:26,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:26,168 INFO L87 Difference]: Start difference. First operand 287 states and 440 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,220 INFO L93 Difference]: Finished difference Result 292 states and 450 transitions. [2024-10-11 21:20:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-10-11 21:20:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,223 INFO L225 Difference]: With dead ends: 292 [2024-10-11 21:20:26,223 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 21:20:26,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:26,225 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 12 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1074 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 21:20:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-10-11 21:20:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.554054054054054) internal successors, (345), 230 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 21:20:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 439 transitions. [2024-10-11 21:20:26,236 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 439 transitions. Word has length 109 [2024-10-11 21:20:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:26,237 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 439 transitions. [2024-10-11 21:20:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 21:20:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 439 transitions. [2024-10-11 21:20:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 21:20:26,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:26,239 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:26,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:26,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:20:26,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash -213569271, now seen corresponding path program 1 times [2024-10-11 21:20:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:26,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603365102] [2024-10-11 21:20:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:20:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603365102] [2024-10-11 21:20:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603365102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616872692] [2024-10-11 21:20:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:26,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:26,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 21:20:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:20:26,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 21:20:26,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:26,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616872692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:26,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:26,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 21:20:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64074363] [2024-10-11 21:20:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:26,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:26,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:26,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:26,815 INFO L87 Difference]: Start difference. First operand 286 states and 439 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:20:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,886 INFO L93 Difference]: Finished difference Result 490 states and 756 transitions. [2024-10-11 21:20:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-10-11 21:20:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,888 INFO L225 Difference]: With dead ends: 490 [2024-10-11 21:20:26,888 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 21:20:26,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:26,890 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 30 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1093 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 21:20:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2024-10-11 21:20:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.56) internal successors, (351), 232 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 447 transitions. [2024-10-11 21:20:26,901 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 447 transitions. Word has length 110 [2024-10-11 21:20:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 447 transitions. [2024-10-11 21:20:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:20:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 447 transitions. [2024-10-11 21:20:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 21:20:26,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:26,903 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:26,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 21:20:27,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2128753937, now seen corresponding path program 1 times [2024-10-11 21:20:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934782033] [2024-10-11 21:20:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 21:20:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934782033] [2024-10-11 21:20:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934782033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:27,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053651665] [2024-10-11 21:20:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:27,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:27,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:27,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 21:20:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:27,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:27,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053651665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377731619] [2024-10-11 21:20:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:27,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:27,475 INFO L87 Difference]: Start difference. First operand 289 states and 447 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:27,520 INFO L93 Difference]: Finished difference Result 298 states and 462 transitions. [2024-10-11 21:20:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-11 21:20:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:27,522 INFO L225 Difference]: With dead ends: 298 [2024-10-11 21:20:27,523 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 21:20:27,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:27,524 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 8 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:27,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 825 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 21:20:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2024-10-11 21:20:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5575221238938053) internal successors, (352), 233 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 448 transitions. [2024-10-11 21:20:27,534 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 448 transitions. Word has length 115 [2024-10-11 21:20:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:27,535 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 448 transitions. [2024-10-11 21:20:27,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 448 transitions. [2024-10-11 21:20:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 21:20:27,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:27,537 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 21:20:27,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:27,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1566862261, now seen corresponding path program 1 times [2024-10-11 21:20:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212777526] [2024-10-11 21:20:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 21:20:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212777526] [2024-10-11 21:20:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212777526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822945820] [2024-10-11 21:20:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:27,927 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:27,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 21:20:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:28,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:28,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822945820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 21:20:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870837514] [2024-10-11 21:20:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:28,140 INFO L87 Difference]: Start difference. First operand 290 states and 448 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:28,188 INFO L93 Difference]: Finished difference Result 293 states and 451 transitions. [2024-10-11 21:20:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-11 21:20:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:28,191 INFO L225 Difference]: With dead ends: 293 [2024-10-11 21:20:28,191 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 21:20:28,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:28,192 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:28,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 853 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 21:20:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-10-11 21:20:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 234 states have internal predecessors, (353), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 449 transitions. [2024-10-11 21:20:28,203 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 449 transitions. Word has length 116 [2024-10-11 21:20:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 449 transitions. [2024-10-11 21:20:28,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 449 transitions. [2024-10-11 21:20:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 21:20:28,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,207 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:28,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:20:28,408 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -351333965, now seen corresponding path program 1 times [2024-10-11 21:20:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324730708] [2024-10-11 21:20:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:20:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324730708] [2024-10-11 21:20:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324730708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406000125] [2024-10-11 21:20:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:28,568 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 21:20:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:20:28,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:28,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406000125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 21:20:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126982202] [2024-10-11 21:20:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:28,802 INFO L87 Difference]: Start difference. First operand 291 states and 449 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:28,859 INFO L93 Difference]: Finished difference Result 299 states and 463 transitions. [2024-10-11 21:20:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-11 21:20:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:28,862 INFO L225 Difference]: With dead ends: 299 [2024-10-11 21:20:28,862 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 21:20:28,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:28,864 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 10 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:28,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1075 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 21:20:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 292. [2024-10-11 21:20:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5526315789473684) internal successors, (354), 235 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-10-11 21:20:28,876 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 117 [2024-10-11 21:20:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,876 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-10-11 21:20:28,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:20:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-10-11 21:20:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 21:20:28,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,878 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:28,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 21:20:29,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:20:29,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:29,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1495198643, now seen corresponding path program 1 times [2024-10-11 21:20:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871987633] [2024-10-11 21:20:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:20:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871987633] [2024-10-11 21:20:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871987633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288622512] [2024-10-11 21:20:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:29,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:29,277 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:29,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 21:20:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:20:29,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:29,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:29,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288622512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:29,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:29,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 21:20:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052028249] [2024-10-11 21:20:29,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:29,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:29,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:29,512 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,574 INFO L93 Difference]: Finished difference Result 306 states and 472 transitions. [2024-10-11 21:20:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-10-11 21:20:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,577 INFO L225 Difference]: With dead ends: 306 [2024-10-11 21:20:29,577 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 21:20:29,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:29,578 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 24 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1091 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1091 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 21:20:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 297. [2024-10-11 21:20:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.5474137931034482) internal successors, (359), 239 states have internal predecessors, (359), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-11 21:20:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 457 transitions. [2024-10-11 21:20:29,590 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 457 transitions. Word has length 117 [2024-10-11 21:20:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,591 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 457 transitions. [2024-10-11 21:20:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 457 transitions. [2024-10-11 21:20:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 21:20:29,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:29,593 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:29,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 21:20:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:29,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1993549319, now seen corresponding path program 1 times [2024-10-11 21:20:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184607422] [2024-10-11 21:20:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:20:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184607422] [2024-10-11 21:20:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184607422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768477909] [2024-10-11 21:20:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:29,938 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:29,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 21:20:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:20:30,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:30,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:30,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768477909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:30,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 21:20:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139392695] [2024-10-11 21:20:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:30,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:30,155 INFO L87 Difference]: Start difference. First operand 297 states and 457 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:30,215 INFO L93 Difference]: Finished difference Result 302 states and 463 transitions. [2024-10-11 21:20:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2024-10-11 21:20:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:30,218 INFO L225 Difference]: With dead ends: 302 [2024-10-11 21:20:30,218 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 21:20:30,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:30,219 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 19 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:30,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1128 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 21:20:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2024-10-11 21:20:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.5474137931034482) internal successors, (359), 239 states have internal predecessors, (359), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-11 21:20:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 457 transitions. [2024-10-11 21:20:30,232 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 457 transitions. Word has length 118 [2024-10-11 21:20:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:30,232 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 457 transitions. [2024-10-11 21:20:30,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 457 transitions. [2024-10-11 21:20:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 21:20:30,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:30,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:30,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 21:20:30,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:30,435 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -893481977, now seen corresponding path program 1 times [2024-10-11 21:20:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367853493] [2024-10-11 21:20:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:20:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:20:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367853493] [2024-10-11 21:20:30,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367853493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765852669] [2024-10-11 21:20:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:30,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:30,605 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:30,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 21:20:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:30,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:20:30,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:30,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:30,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765852669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 21:20:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097223537] [2024-10-11 21:20:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:30,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:30,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:30,827 INFO L87 Difference]: Start difference. First operand 297 states and 457 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:30,879 INFO L93 Difference]: Finished difference Result 514 states and 792 transitions. [2024-10-11 21:20:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2024-10-11 21:20:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:30,882 INFO L225 Difference]: With dead ends: 514 [2024-10-11 21:20:30,882 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 21:20:30,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:30,884 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 24 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:30,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1132 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 21:20:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 293. [2024-10-11 21:20:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 236 states have internal predecessors, (355), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-10-11 21:20:30,894 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 118 [2024-10-11 21:20:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-10-11 21:20:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-10-11 21:20:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 21:20:30,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:30,897 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:30,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 21:20:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 21:20:31,102 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 198807927, now seen corresponding path program 1 times [2024-10-11 21:20:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967949006] [2024-10-11 21:20:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 21:20:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967949006] [2024-10-11 21:20:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967949006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76333684] [2024-10-11 21:20:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:31,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:31,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:31,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 21:20:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:20:31,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:31,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76333684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-11 21:20:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338190653] [2024-10-11 21:20:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:31,487 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:31,560 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2024-10-11 21:20:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:20:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2024-10-11 21:20:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:31,564 INFO L225 Difference]: With dead ends: 308 [2024-10-11 21:20:31,564 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 21:20:31,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:31,565 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 21 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:31,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1587 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 21:20:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2024-10-11 21:20:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 21:20:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-10-11 21:20:31,576 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 119 [2024-10-11 21:20:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:31,577 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-10-11 21:20:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 21:20:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-10-11 21:20:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 21:20:31,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:31,579 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:20:31,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-11 21:20:31,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:31,780 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:20:31,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1868078787, now seen corresponding path program 1 times [2024-10-11 21:20:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382691008] [2024-10-11 21:20:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 21:20:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:20:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 21:20:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 21:20:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:20:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:20:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:20:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:20:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 21:20:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:20:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382691008] [2024-10-11 21:20:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382691008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531885891] [2024-10-11 21:20:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:31,961 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 21:20:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:32,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:20:32,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:20:32,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531885891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-11 21:20:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995093207] [2024-10-11 21:20:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:20:32,217 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 21:20:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:32,287 INFO L93 Difference]: Finished difference Result 306 states and 475 transitions. [2024-10-11 21:20:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:20:32,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2024-10-11 21:20:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:32,289 INFO L225 Difference]: With dead ends: 306 [2024-10-11 21:20:32,289 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:20:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:20:32,291 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 37 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:32,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1595 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:20:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:20:32,292 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-11 21:20:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:20:32,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-10-11 21:20:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:32,292 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:20:32,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 21:20:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:20:32,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:20:32,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 21:20:32,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 21:20:32,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 21:20:32,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 21:20:32,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 21:20:32,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 21:20:32,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 21:20:32,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 21:20:32,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 21:20:32,500 INFO L407 BasicCegarLoop]: Path program histogram: [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-11 21:20:32,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:20:32,823 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:20:32,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:20:32 BoogieIcfgContainer [2024-10-11 21:20:32,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:20:32,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:20:32,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:20:32,843 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:20:32,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:17" (3/4) ... [2024-10-11 21:20:32,846 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:20:32,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-10-11 21:20:32,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-10-11 21:20:32,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-11 21:20:32,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-10-11 21:20:32,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 21:20:32,850 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-10-11 21:20:32,866 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-11 21:20:32,867 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 21:20:32,867 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:20:32,868 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:20:32,899 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-11 21:20:32,971 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-11 21:20:33,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:20:33,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:20:33,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:20:33,022 INFO L158 Benchmark]: Toolchain (without parser) took 17220.60ms. Allocated memory was 146.8MB in the beginning and 331.4MB in the end (delta: 184.5MB). Free memory was 93.7MB in the beginning and 160.2MB in the end (delta: -66.6MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,023 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 146.8MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:20:33,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.41ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 75.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.34ms. Allocated memory is still 146.8MB. Free memory was 74.8MB in the beginning and 71.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,023 INFO L158 Benchmark]: Boogie Preprocessor took 64.07ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 67.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,023 INFO L158 Benchmark]: RCFGBuilder took 998.66ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 67.6MB in the beginning and 132.2MB in the end (delta: -64.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,024 INFO L158 Benchmark]: TraceAbstraction took 15461.85ms. Allocated memory was 188.7MB in the beginning and 331.4MB in the end (delta: 142.6MB). Free memory was 131.1MB in the beginning and 170.7MB in the end (delta: -39.6MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,024 INFO L158 Benchmark]: Witness Printer took 179.34ms. Allocated memory is still 331.4MB. Free memory was 170.7MB in the beginning and 160.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,026 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 146.8MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.41ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 75.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.34ms. Allocated memory is still 146.8MB. Free memory was 74.8MB in the beginning and 71.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.07ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 67.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 998.66ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 67.6MB in the beginning and 132.2MB in the end (delta: -64.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15461.85ms. Allocated memory was 188.7MB in the beginning and 331.4MB in the end (delta: 142.6MB). Free memory was 131.1MB in the beginning and 170.7MB in the end (delta: -39.6MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Witness Printer took 179.34ms. Allocated memory is still 331.4MB. Free memory was 170.7MB in the beginning and 160.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: 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 7 procedures, 189 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 22486 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16053 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1130 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 6433 mSDtfsCounter, 1130 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2639 GetRequests, 2470 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=19, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 132 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 4194 NumberOfCodeBlocks, 4194 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10478 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 1927/1991 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 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 21:20:33,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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