./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll2_unwindbound5.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/nla-digbench-scaling/geo1-ll2_unwindbound5.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 757749d35671eda7818ce7a9276fa400eff8da4461713202236766545f2a8763 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:49:55,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:49:55,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:49:55,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:49:55,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:49:55,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:49:55,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:49:55,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:49:55,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:49:55,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:49:55,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:49:55,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:49:55,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:49:55,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:49:55,539 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:49:55,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:49:55,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:49:55,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:49:55,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:49:55,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:49:55,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:49:55,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:49:55,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:49:55,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:49:55,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:49:55,546 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:49:55,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:49:55,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:49:55,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:49:55,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:49:55,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:49:55,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:49:55,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:49:55,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:49:55,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:55,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:49:55,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:49:55,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:49:55,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:49:55,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:49:55,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:49:55,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:49:55,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:49:55,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:49:55,556 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 -> 757749d35671eda7818ce7a9276fa400eff8da4461713202236766545f2a8763 [2024-10-11 20:49:55,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:49:55,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:49:55,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:49:55,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:49:55,814 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:49:55,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll2_unwindbound5.c [2024-10-11 20:49:57,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:49:57,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:49:57,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll2_unwindbound5.c [2024-10-11 20:49:57,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54942de1e/e6278fe4f56c4a95bc3f6a743c1a4cdb/FLAG0a22372ad [2024-10-11 20:49:57,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54942de1e/e6278fe4f56c4a95bc3f6a743c1a4cdb [2024-10-11 20:49:57,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:49:57,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:49:57,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:57,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:49:57,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:49:57,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2b9960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57, skipping insertion in model container [2024-10-11 20:49:57,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:49:57,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:57,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:49:57,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:57,872 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:49:57,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57 WrapperNode [2024-10-11 20:49:57,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:57,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:57,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:49:57,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:49:57,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,906 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-11 20:49:57,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:57,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:49:57,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:49:57,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:49:57,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,941 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 20:49:57,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:49:57,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:49:57,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:49:57,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:49:57,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (1/1) ... [2024-10-11 20:49:57,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:57,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:57,990 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 20:49:57,993 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 20:49:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:49:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:49:58,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:49:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:49:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:49:58,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:49:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:49:58,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:49:58,099 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:49:58,101 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:49:58,364 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-11 20:49:58,365 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:49:58,391 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:49:58,391 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:49:58,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:58 BoogieIcfgContainer [2024-10-11 20:49:58,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:49:58,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:49:58,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:49:58,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:49:58,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:49:57" (1/3) ... [2024-10-11 20:49:58,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a13f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:58, skipping insertion in model container [2024-10-11 20:49:58,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:57" (2/3) ... [2024-10-11 20:49:58,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a13f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:58, skipping insertion in model container [2024-10-11 20:49:58,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:58" (3/3) ... [2024-10-11 20:49:58,407 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll2_unwindbound5.c [2024-10-11 20:49:58,425 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:49:58,425 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-11 20:49:58,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:49:58,502 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;@4d74de7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:49:58,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-11 20:49:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:49:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:49:58,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:58,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:58,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:49:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2005083564, now seen corresponding path program 1 times [2024-10-11 20:49:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932291200] [2024-10-11 20:49:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:49:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:49:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:49:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932291200] [2024-10-11 20:49:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932291200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:49:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343043365] [2024-10-11 20:49:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:58,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:49:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:49:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:49:58,744 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:49:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:58,770 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2024-10-11 20:49:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:49:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:49:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:58,779 INFO L225 Difference]: With dead ends: 140 [2024-10-11 20:49:58,780 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 20:49:58,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:49:58,786 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:49:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 20:49:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 20:49:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:49:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-10-11 20:49:58,832 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 14 [2024-10-11 20:49:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:58,833 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-10-11 20:49:58,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:49:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2024-10-11 20:49:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:49:58,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:58,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:58,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:49:58,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:49:58,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1246760684, now seen corresponding path program 1 times [2024-10-11 20:49:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422515510] [2024-10-11 20:49:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:49:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:49:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:49:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422515510] [2024-10-11 20:49:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422515510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:49:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985274269] [2024-10-11 20:49:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:59,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:49:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:49:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:49:59,026 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:49:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:59,092 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-10-11 20:49:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:49:59,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-11 20:49:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:59,095 INFO L225 Difference]: With dead ends: 90 [2024-10-11 20:49:59,096 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 20:49:59,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 20:49:59,098 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:59,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 185 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:49:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 20:49:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 20:49:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:49:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-10-11 20:49:59,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 14 [2024-10-11 20:49:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-10-11 20:49:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:49:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-10-11 20:49:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:49:59,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:59,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:59,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:49:59,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:49:59,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:59,112 INFO L85 PathProgramCache]: Analyzing trace with hash 629682618, now seen corresponding path program 1 times [2024-10-11 20:49:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152669872] [2024-10-11 20:49:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:49:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071348329] [2024-10-11 20:49:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:59,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:59,143 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 20:49:59,145 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 20:49:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:59,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:49:59,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:49:59,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:49:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152669872] [2024-10-11 20:49:59,306 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:49:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071348329] [2024-10-11 20:49:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071348329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:49:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819700551] [2024-10-11 20:49:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:59,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:49:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:49:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:49:59,309 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:49:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:59,551 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2024-10-11 20:49:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:49:59,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 20:49:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:59,552 INFO L225 Difference]: With dead ends: 99 [2024-10-11 20:49:59,552 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:49:59,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:49:59,554 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:59,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 70 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:49:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:49:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-11 20:49:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 83 states have internal predecessors, (97), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:49:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2024-10-11 20:49:59,566 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 17 [2024-10-11 20:49:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2024-10-11 20:49:59,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:49:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2024-10-11 20:49:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:49:59,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:59,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:59,581 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 20:49:59,768 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 20:49:59,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:49:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1954675269, now seen corresponding path program 1 times [2024-10-11 20:49:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714191092] [2024-10-11 20:49:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:49:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836091426] [2024-10-11 20:49:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:59,790 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 20:49:59,794 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 20:49:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:59,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:49:59,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:49:59,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:49:59,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714191092] [2024-10-11 20:49:59,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:49:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836091426] [2024-10-11 20:49:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836091426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:49:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007216427] [2024-10-11 20:49:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:49:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:49:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:49:59,899 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:00,063 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-10-11 20:50:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:50:00,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 20:50:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:00,065 INFO L225 Difference]: With dead ends: 99 [2024-10-11 20:50:00,065 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:50:00,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:00,068 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:00,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 70 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:50:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:50:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 20:50:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 84 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-10-11 20:50:00,080 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 18 [2024-10-11 20:50:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:00,081 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-10-11 20:50:00,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-10-11 20:50:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:50:00,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:00,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:00,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:00,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -564284930, now seen corresponding path program 1 times [2024-10-11 20:50:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342236094] [2024-10-11 20:50:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:00,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318248198] [2024-10-11 20:50:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:00,302 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 20:50:00,303 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 20:50:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:00,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:50:00,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:00,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342236094] [2024-10-11 20:50:00,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318248198] [2024-10-11 20:50:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318248198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:50:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931577084] [2024-10-11 20:50:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:50:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:50:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:50:00,402 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:00,508 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-10-11 20:50:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:50:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 20:50:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:00,509 INFO L225 Difference]: With dead ends: 95 [2024-10-11 20:50:00,509 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:50:00,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:50:00,511 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:00,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:50:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 20:50:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 84 states have internal predecessors, (92), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-11 20:50:00,522 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 21 [2024-10-11 20:50:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-11 20:50:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-11 20:50:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:50:00,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:00,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:00,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:00,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:00,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -312963585, now seen corresponding path program 1 times [2024-10-11 20:50:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228551522] [2024-10-11 20:50:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228551522] [2024-10-11 20:50:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228551522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615905740] [2024-10-11 20:50:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:00,983 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 20:50:00,984 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 20:50:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:50:01,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:01,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615905740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 20:50:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388810277] [2024-10-11 20:50:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:50:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:01,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:50:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:50:01,077 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:01,220 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-10-11 20:50:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:50:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 20:50:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:01,221 INFO L225 Difference]: With dead ends: 95 [2024-10-11 20:50:01,221 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:50:01,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:50:01,222 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:01,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:50:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 20:50:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.5) internal successors, (90), 84 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2024-10-11 20:50:01,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 22 [2024-10-11 20:50:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:01,233 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2024-10-11 20:50:01,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-10-11 20:50:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:50:01,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:01,234 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:01,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:01,438 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,SelfDestructingSolverStorable5 [2024-10-11 20:50:01,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:01,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 697166701, now seen corresponding path program 1 times [2024-10-11 20:50:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336978638] [2024-10-11 20:50:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336978638] [2024-10-11 20:50:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336978638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851058539] [2024-10-11 20:50:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:01,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:01,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:01,570 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 20:50:01,571 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 20:50:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:01,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:50:01,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:01,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851058539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:50:01,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:50:01,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-11 20:50:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265924056] [2024-10-11 20:50:01,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:50:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:50:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:50:01,756 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:50:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:01,888 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-10-11 20:50:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2024-10-11 20:50:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:01,890 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:50:01,890 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 20:50:01,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:50:01,891 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:01,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 120 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 20:50:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 20:50:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 83 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-10-11 20:50:01,897 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 31 [2024-10-11 20:50:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:01,898 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-10-11 20:50:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:50:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-10-11 20:50:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:50:01,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:01,899 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:01,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:02,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:02,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:02,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 697166744, now seen corresponding path program 1 times [2024-10-11 20:50:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732131787] [2024-10-11 20:50:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732131787] [2024-10-11 20:50:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732131787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:50:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43488375] [2024-10-11 20:50:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:50:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:50:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:50:02,178 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:02,197 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-10-11 20:50:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:50:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-11 20:50:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:02,199 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:50:02,199 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 20:50:02,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:50:02,200 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:02,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 20:50:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 20:50:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 83 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-10-11 20:50:02,212 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 31 [2024-10-11 20:50:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:02,213 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-10-11 20:50:02,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-10-11 20:50:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:50:02,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:02,214 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:02,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:50:02,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1865638799, now seen corresponding path program 1 times [2024-10-11 20:50:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649989275] [2024-10-11 20:50:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649989275] [2024-10-11 20:50:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649989275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:50:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262063755] [2024-10-11 20:50:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:50:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:50:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:50:02,283 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:02,569 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2024-10-11 20:50:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-11 20:50:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:02,570 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:50:02,570 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 20:50:02,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:50:02,571 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:02,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 94 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:50:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 20:50:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2024-10-11 20:50:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 84 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-10-11 20:50:02,578 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 35 [2024-10-11 20:50:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:02,579 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-10-11 20:50:02,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-10-11 20:50:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:50:02,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:02,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:50:02,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2000227819, now seen corresponding path program 1 times [2024-10-11 20:50:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910362964] [2024-10-11 20:50:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910362964] [2024-10-11 20:50:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910362964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:50:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329184107] [2024-10-11 20:50:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:50:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:02,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:50:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:50:02,648 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:02,826 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-10-11 20:50:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 20:50:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:02,827 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:50:02,827 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:50:02,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:50:02,828 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:02,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 81 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:50:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:50:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 20:50:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-10-11 20:50:02,833 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 36 [2024-10-11 20:50:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:02,833 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-10-11 20:50:02,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-10-11 20:50:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:50:02,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:02,834 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:50:02,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1877520141, now seen corresponding path program 1 times [2024-10-11 20:50:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:02,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840561620] [2024-10-11 20:50:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840561620] [2024-10-11 20:50:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840561620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:50:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482152696] [2024-10-11 20:50:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:02,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:02,926 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:03,332 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-10-11 20:50:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:50:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 20:50:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:03,333 INFO L225 Difference]: With dead ends: 101 [2024-10-11 20:50:03,333 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 20:50:03,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 20:50:03,334 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:03,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:50:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 20:50:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 20:50:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-10-11 20:50:03,340 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2024-10-11 20:50:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-10-11 20:50:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-10-11 20:50:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:50:03,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:03,341 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:03,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:50:03,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1363314110, now seen corresponding path program 1 times [2024-10-11 20:50:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439183948] [2024-10-11 20:50:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:03,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120357452] [2024-10-11 20:50:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:03,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:03,354 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 20:50:03,356 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 20:50:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:03,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:50:03,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:03,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439183948] [2024-10-11 20:50:03,708 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120357452] [2024-10-11 20:50:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120357452] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:03,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 20:50:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256882947] [2024-10-11 20:50:03,709 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:03,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:50:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:50:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:50:03,711 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:03,831 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-10-11 20:50:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:50:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-10-11 20:50:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:03,833 INFO L225 Difference]: With dead ends: 98 [2024-10-11 20:50:03,833 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 20:50:03,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:50:03,834 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:03,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 20:50:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 20:50:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 90 states have internal predecessors, (97), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-10-11 20:50:03,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 37 [2024-10-11 20:50:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:03,841 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-10-11 20:50:03,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-10-11 20:50:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:50:03,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:03,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:03,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:04,046 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,SelfDestructingSolverStorable11 [2024-10-11 20:50:04,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1926417879, now seen corresponding path program 1 times [2024-10-11 20:50:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734450715] [2024-10-11 20:50:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:04,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734450715] [2024-10-11 20:50:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734450715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:50:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279809501] [2024-10-11 20:50:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:04,176 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:04,481 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-10-11 20:50:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:50:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 20:50:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:04,482 INFO L225 Difference]: With dead ends: 99 [2024-10-11 20:50:04,483 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 20:50:04,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:04,483 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:04,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 84 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:50:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 20:50:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 20:50:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 83 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-10-11 20:50:04,491 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 38 [2024-10-11 20:50:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:04,491 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-10-11 20:50:04,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-10-11 20:50:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:50:04,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:04,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:50:04,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -686935463, now seen corresponding path program 1 times [2024-10-11 20:50:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695356625] [2024-10-11 20:50:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866724340] [2024-10-11 20:50:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:04,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:04,511 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 20:50:04,512 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 20:50:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:04,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:50:04,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:04,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695356625] [2024-10-11 20:50:05,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866724340] [2024-10-11 20:50:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866724340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:05,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 20:50:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766932159] [2024-10-11 20:50:05,155 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:50:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:50:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:50:05,156 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:05,283 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-10-11 20:50:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:50:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 20:50:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:05,285 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:50:05,285 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:50:05,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:50:05,285 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:05,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 120 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:50:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 20:50:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 85 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-10-11 20:50:05,290 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 38 [2024-10-11 20:50:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:05,291 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-10-11 20:50:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-10-11 20:50:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:50:05,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:05,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:05,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:50:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:05,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1279984923, now seen corresponding path program 1 times [2024-10-11 20:50:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293552917] [2024-10-11 20:50:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293552917] [2024-10-11 20:50:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293552917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251765165] [2024-10-11 20:50:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:05,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:05,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:05,590 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 20:50:05,591 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 20:50:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:50:05,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:05,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251765165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:50:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384085760] [2024-10-11 20:50:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:05,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:50:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:50:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:05,697 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:05,717 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-11 20:50:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:50:05,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-11 20:50:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:05,718 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:50:05,718 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 20:50:05,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:50:05,719 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:05,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 20:50:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 20:50:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-10-11 20:50:05,725 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 40 [2024-10-11 20:50:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:05,725 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-10-11 20:50:05,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-10-11 20:50:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:50:05,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:05,726 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:05,742 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 20:50:05,926 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,SelfDestructingSolverStorable14 [2024-10-11 20:50:05,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:05,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1024826993, now seen corresponding path program 1 times [2024-10-11 20:50:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:05,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566474638] [2024-10-11 20:50:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:05,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566474638] [2024-10-11 20:50:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566474638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136145976] [2024-10-11 20:50:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:06,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:06,009 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 20:50:06,010 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 20:50:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:06,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:50:06,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:06,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136145976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:06,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:50:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792057420] [2024-10-11 20:50:06,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:50:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:50:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:06,117 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:06,157 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2024-10-11 20:50:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:06,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-10-11 20:50:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:06,158 INFO L225 Difference]: With dead ends: 95 [2024-10-11 20:50:06,158 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:50:06,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:50:06,159 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:06,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:50:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-11 20:50:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-10-11 20:50:06,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 41 [2024-10-11 20:50:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:06,165 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-10-11 20:50:06,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:50:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-10-11 20:50:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:50:06,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:06,166 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:06,184 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 20:50:06,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:06,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1311231059, now seen corresponding path program 1 times [2024-10-11 20:50:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:06,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940319992] [2024-10-11 20:50:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415414779] [2024-10-11 20:50:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:06,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:06,383 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 20:50:06,384 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 20:50:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:06,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:50:06,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:06,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940319992] [2024-10-11 20:50:06,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415414779] [2024-10-11 20:50:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415414779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:06,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-11 20:50:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113775939] [2024-10-11 20:50:06,809 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:50:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:50:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:06,810 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:06,982 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-10-11 20:50:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:50:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2024-10-11 20:50:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:06,983 INFO L225 Difference]: With dead ends: 90 [2024-10-11 20:50:06,983 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 20:50:06,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:06,984 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:06,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 153 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:50:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 20:50:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 20:50:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-10-11 20:50:06,988 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 43 [2024-10-11 20:50:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-10-11 20:50:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-10-11 20:50:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:50:06,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:06,990 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:50:07,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:50:07,194 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,SelfDestructingSolverStorable16 [2024-10-11 20:50:07,195 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1993457218, now seen corresponding path program 1 times [2024-10-11 20:50:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538875988] [2024-10-11 20:50:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593174441] [2024-10-11 20:50:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:07,207 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 20:50:07,209 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 20:50:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:07,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:50:07,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:07,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538875988] [2024-10-11 20:50:07,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593174441] [2024-10-11 20:50:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593174441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:07,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-11 20:50:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404190931] [2024-10-11 20:50:07,988 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:07,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:50:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:50:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:07,990 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:08,125 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-10-11 20:50:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:50:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-10-11 20:50:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:08,126 INFO L225 Difference]: With dead ends: 120 [2024-10-11 20:50:08,126 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 20:50:08,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:50:08,127 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:08,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 126 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:50:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 20:50:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-10-11 20:50:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 105 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:50:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-10-11 20:50:08,135 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 44 [2024-10-11 20:50:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:08,135 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-10-11 20:50:08,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-10-11 20:50:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:50:08,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:08,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:08,153 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 20:50:08,340 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,SelfDestructingSolverStorable17 [2024-10-11 20:50:08,341 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:08,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 553102530, now seen corresponding path program 1 times [2024-10-11 20:50:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:08,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504252995] [2024-10-11 20:50:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:08,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:08,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504252995] [2024-10-11 20:50:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504252995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:50:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579229698] [2024-10-11 20:50:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:08,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:08,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:08,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:08,434 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:50:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:08,838 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-10-11 20:50:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:08,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-11 20:50:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:08,839 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:50:08,840 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:50:08,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 20:50:08,840 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:08,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 74 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:50:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:50:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 20:50:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 104 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:50:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-10-11 20:50:08,848 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 47 [2024-10-11 20:50:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:08,848 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-10-11 20:50:08,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:50:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-10-11 20:50:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:50:08,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:08,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:08,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:50:08,849 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash 571234327, now seen corresponding path program 1 times [2024-10-11 20:50:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511161818] [2024-10-11 20:50:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:08,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072189884] [2024-10-11 20:50:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:08,865 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 20:50:08,866 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 20:50:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:08,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:50:08,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:09,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511161818] [2024-10-11 20:50:09,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:50:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072189884] [2024-10-11 20:50:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072189884] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:50:09,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:50:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 20:50:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121182532] [2024-10-11 20:50:09,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:50:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:50:09,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:50:09,412 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:50:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:10,292 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2024-10-11 20:50:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:50:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-10-11 20:50:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:10,293 INFO L225 Difference]: With dead ends: 132 [2024-10-11 20:50:10,293 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 20:50:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:50:10,294 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:10,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:50:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 20:50:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-11 20:50:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 115 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:50:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2024-10-11 20:50:10,304 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 47 [2024-10-11 20:50:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:10,304 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2024-10-11 20:50:10,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:50:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2024-10-11 20:50:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 20:50:10,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:10,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:10,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 20:50:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:10,506 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -33690652, now seen corresponding path program 1 times [2024-10-11 20:50:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052397139] [2024-10-11 20:50:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052397139] [2024-10-11 20:50:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052397139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246056303] [2024-10-11 20:50:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:10,602 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 20:50:10,603 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 20:50:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:10,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:50:10,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:10,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246056303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:50:10,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:50:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-11 20:50:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602912277] [2024-10-11 20:50:10,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:10,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:50:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:50:10,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:50:10,784 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 20:50:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:10,887 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2024-10-11 20:50:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:50:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 48 [2024-10-11 20:50:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:10,889 INFO L225 Difference]: With dead ends: 187 [2024-10-11 20:50:10,889 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 20:50:10,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:50:10,890 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:10,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 20:50:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2024-10-11 20:50:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 136 states have internal predecessors, (153), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:50:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2024-10-11 20:50:10,898 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 48 [2024-10-11 20:50:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:10,899 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2024-10-11 20:50:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 20:50:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2024-10-11 20:50:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 20:50:10,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:10,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:10,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:11,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:11,101 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:11,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash 33195633, now seen corresponding path program 1 times [2024-10-11 20:50:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16401273] [2024-10-11 20:50:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:50:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16401273] [2024-10-11 20:50:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16401273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299248330] [2024-10-11 20:50:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:11,158 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 20:50:11,160 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 20:50:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:50:11,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:11,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299248330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 20:50:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832319486] [2024-10-11 20:50:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:50:11,265 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:50:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:11,287 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2024-10-11 20:50:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:50:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2024-10-11 20:50:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:11,290 INFO L225 Difference]: With dead ends: 150 [2024-10-11 20:50:11,290 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 20:50:11,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 20:50:11,291 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:11,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 122 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 20:50:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-10-11 20:50:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 135 states have internal predecessors, (150), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:50:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2024-10-11 20:50:11,301 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 57 [2024-10-11 20:50:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:11,301 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2024-10-11 20:50:11,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:50:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2024-10-11 20:50:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 20:50:11,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:11,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:11,317 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 20:50:11,503 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,SelfDestructingSolverStorable21 [2024-10-11 20:50:11,503 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:11,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1029064698, now seen corresponding path program 1 times [2024-10-11 20:50:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087196119] [2024-10-11 20:50:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:50:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:50:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087196119] [2024-10-11 20:50:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087196119] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992222391] [2024-10-11 20:50:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:11,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:11,569 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 20:50:11,571 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 20:50:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:11,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:50:11,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:11,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:50:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992222391] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:50:11,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:50:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 20:50:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716255981] [2024-10-11 20:50:11,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:50:11,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:50:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:50:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:50:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:50:11,731 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 20:50:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:11,773 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2024-10-11 20:50:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:50:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 58 [2024-10-11 20:50:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:11,774 INFO L225 Difference]: With dead ends: 173 [2024-10-11 20:50:11,774 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 20:50:11,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:50:11,775 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:11,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 200 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 20:50:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2024-10-11 20:50:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 146 states have internal predecessors, (165), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:50:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2024-10-11 20:50:11,786 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 58 [2024-10-11 20:50:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:11,786 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2024-10-11 20:50:11,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 20:50:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2024-10-11 20:50:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:50:11,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:11,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:50:11,992 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1349924572, now seen corresponding path program 1 times [2024-10-11 20:50:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:50:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757708375] [2024-10-11 20:50:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:50:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:50:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:50:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:50:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:50:12,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 20:50:12,258 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig$NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 20:50:12,263 INFO L158 Benchmark]: Toolchain (without parser) took 14741.36ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 98.8MB in the beginning and 171.2MB in the end (delta: -72.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:50:12,263 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:50:12,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.17ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 134.7MB in the end (delta: -36.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:50:12,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.87ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 133.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:50:12,264 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 165.7MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:50:12,264 INFO L158 Benchmark]: RCFGBuilder took 434.62ms. Allocated memory is still 165.7MB. Free memory was 131.2MB in the beginning and 115.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:50:12,265 INFO L158 Benchmark]: TraceAbstraction took 13864.34ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 114.5MB in the beginning and 171.2MB in the end (delta: -56.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:50:12,266 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.03ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.17ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 134.7MB in the end (delta: -36.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.87ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 133.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 165.7MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.62ms. Allocated memory is still 165.7MB. Free memory was 131.2MB in the beginning and 115.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13864.34ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 114.5MB in the beginning and 171.2MB in the end (delta: -56.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:388) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 20:50:12,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/nla-digbench-scaling/geo1-ll2_unwindbound5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 757749d35671eda7818ce7a9276fa400eff8da4461713202236766545f2a8763 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:50:14,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:50:14,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-11 20:50:14,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:50:14,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:50:14,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:50:14,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:50:14,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:50:14,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:50:14,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:50:14,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:50:14,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:50:14,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:50:14,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:50:14,646 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:50:14,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:50:14,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:50:14,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:50:14,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:50:14,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:50:14,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:50:14,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:50:14,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:50:14,652 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:50:14,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:50:14,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:50:14,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:50:14,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:50:14,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:50:14,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:50:14,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:50:14,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:50:14,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:50:14,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:50:14,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:50:14,661 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:50:14,663 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 20:50:14,664 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 -> 757749d35671eda7818ce7a9276fa400eff8da4461713202236766545f2a8763 [2024-10-11 20:50:14,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:50:14,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:50:14,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:50:14,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:50:14,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:50:14,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll2_unwindbound5.c [2024-10-11 20:50:16,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:50:16,749 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:50:16,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll2_unwindbound5.c [2024-10-11 20:50:16,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aeb1ef1e1/78efd54f75fd4ba29e2c9b0914a425f8/FLAGa99cc4b65 [2024-10-11 20:50:17,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aeb1ef1e1/78efd54f75fd4ba29e2c9b0914a425f8 [2024-10-11 20:50:17,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:50:17,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:50:17,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:50:17,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:50:17,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:50:17,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62303716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17, skipping insertion in model container [2024-10-11 20:50:17,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:50:17,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:50:17,361 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:50:17,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:50:17,405 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:50:17,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17 WrapperNode [2024-10-11 20:50:17,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:50:17,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:50:17,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:50:17,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:50:17,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,450 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-11 20:50:17,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:50:17,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:50:17,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:50:17,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:50:17,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,482 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 20:50:17,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:50:17,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:50:17,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:50:17,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:50:17,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (1/1) ... [2024-10-11 20:50:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:50:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:50:17,546 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 20:50:17,550 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 20:50:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:50:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 20:50:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:50:17,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:50:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:50:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:50:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:50:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:50:17,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:50:17,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:50:23,025 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-11 20:50:23,025 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:50:23,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:50:23,052 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:50:23,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:50:23 BoogieIcfgContainer [2024-10-11 20:50:23,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:50:23,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:50:23,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:50:23,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:50:23,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:50:17" (1/3) ... [2024-10-11 20:50:23,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aaa5567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:50:23, skipping insertion in model container [2024-10-11 20:50:23,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:50:17" (2/3) ... [2024-10-11 20:50:23,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aaa5567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:50:23, skipping insertion in model container [2024-10-11 20:50:23,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:50:23" (3/3) ... [2024-10-11 20:50:23,060 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll2_unwindbound5.c [2024-10-11 20:50:23,075 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:50:23,075 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-11 20:50:23,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:50:23,140 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;@5bb99ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:50:23,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-11 20:50:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:50:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:50:23,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:23,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:23,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2005083564, now seen corresponding path program 1 times [2024-10-11 20:50:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:50:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965521623] [2024-10-11 20:50:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:23,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:50:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:50:23,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:50:23,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 20:50:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:23,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 20:50:23,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:23,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:23,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:50:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965521623] [2024-10-11 20:50:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965521623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:50:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954326269] [2024-10-11 20:50:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:50:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:50:23,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:50:23,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:50:23,306 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:23,337 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2024-10-11 20:50:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:50:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-11 20:50:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:23,345 INFO L225 Difference]: With dead ends: 134 [2024-10-11 20:50:23,345 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:50:23,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:50:23,352 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:23,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:50:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 20:50:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-10-11 20:50:23,383 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 14 [2024-10-11 20:50:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:23,384 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-10-11 20:50:23,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-10-11 20:50:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:50:23,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:23,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:23,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 20:50:23,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:50:23,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 5124504, now seen corresponding path program 1 times [2024-10-11 20:50:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:50:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844169041] [2024-10-11 20:50:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:50:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:50:23,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:50:23,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 20:50:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:23,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:50:23,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:23,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:23,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:50:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844169041] [2024-10-11 20:50:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844169041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:50:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025465810] [2024-10-11 20:50:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:23,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:23,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:50:23,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:23,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:23,803 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:23,880 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-10-11 20:50:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:50:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-10-11 20:50:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:23,882 INFO L225 Difference]: With dead ends: 81 [2024-10-11 20:50:23,882 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 20:50:23,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 20:50:23,883 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:23,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:50:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 20:50:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 20:50:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:50:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2024-10-11 20:50:23,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 15 [2024-10-11 20:50:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2024-10-11 20:50:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2024-10-11 20:50:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:50:23,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:23,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:23,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:50:24,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:50:24,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:50:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 629682618, now seen corresponding path program 1 times [2024-10-11 20:50:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:50:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024268664] [2024-10-11 20:50:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:50:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:50:24,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:50:24,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 20:50:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:24,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:50:24,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:50:24,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:50:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:50:29,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:50:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024268664] [2024-10-11 20:50:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024268664] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 20:50:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:50:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 20:50:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372531728] [2024-10-11 20:50:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:50:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:50:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:50:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:50:29,594 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:50:42,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:46,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:53,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:58,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:02,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:04,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:06,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:08,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:12,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:18,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:20,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:51:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:51:20,738 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-11 20:51:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:51:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 20:51:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:51:20,780 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:51:20,780 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 20:51:20,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:51:20,781 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:51:20,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 51.1s Time] [2024-10-11 20:51:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 20:51:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-11 20:51:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:51:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2024-10-11 20:51:20,794 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 17 [2024-10-11 20:51:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:51:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2024-10-11 20:51:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:51:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2024-10-11 20:51:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:51:20,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:51:20,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:51:20,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:51:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:51:20,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2024-10-11 20:51:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:51:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1954675269, now seen corresponding path program 1 times [2024-10-11 20:51:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:51:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224999481] [2024-10-11 20:51:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:51:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:51:20,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:51:21,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:51:21,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 20:51:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:51:21,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:51:21,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:51:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:51:21,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:51:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:51:30,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:51:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224999481] [2024-10-11 20:51:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224999481] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 20:51:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:51:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 20:51:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264455392] [2024-10-11 20:51:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:51:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:51:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:51:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:51:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:51:30,711 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)