./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/ps6-ll_unwindbound100.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/ps6-ll_unwindbound100.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 e40af029af23d5cbf5d8bd74acfdc7af42526c81be3e447d3e43ec16d52857d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:09:20,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:09:20,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:09:20,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:09:20,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:09:20,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:09:20,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:09:20,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:09:20,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:09:20,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:09:20,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:09:20,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:09:20,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:09:20,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:09:20,559 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:09:20,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:09:20,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:09:20,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:09:20,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:09:20,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:09:20,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:09:20,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:09:20,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:09:20,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:09:20,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:09:20,565 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:09:20,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:09:20,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:09:20,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:09:20,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:09:20,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:09:20,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:09:20,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:09:20,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:09:20,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:09:20,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:09:20,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:09:20,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:09:20,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:09:20,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:09:20,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:09:20,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:09:20,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:09:20,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:09:20,570 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 -> e40af029af23d5cbf5d8bd74acfdc7af42526c81be3e447d3e43ec16d52857d1 [2024-10-11 21:09:20,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:09:20,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:09:20,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:09:20,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:09:20,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:09:20,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound100.c [2024-10-11 21:09:22,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:09:22,321 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:09:22,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound100.c [2024-10-11 21:09:22,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fefa4d868/bf35c1dcd3734990bb100b81e2ad46f0/FLAGef8a514a5 [2024-10-11 21:09:22,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fefa4d868/bf35c1dcd3734990bb100b81e2ad46f0 [2024-10-11 21:09:22,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:09:22,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:09:22,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:09:22,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:09:22,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:09:22,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:09:22" (1/1) ... [2024-10-11 21:09:22,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb33aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:22, skipping insertion in model container [2024-10-11 21:09:22,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:09:22" (1/1) ... [2024-10-11 21:09:22,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:09:22,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:09:22,986 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:09:23,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:09:23,020 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:09:23,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23 WrapperNode [2024-10-11 21:09:23,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:09:23,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:09:23,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:09:23,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:09:23,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,075 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-10-11 21:09:23,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:09:23,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:09:23,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:09:23,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:09:23,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,097 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:09:23,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:09:23,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:09:23,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:09:23,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:09:23,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (1/1) ... [2024-10-11 21:09:23,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:09:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:23,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:09:23,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:09:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:09:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:09:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:09:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:09:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:09:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:09:23,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:09:23,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:09:23,693 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 21:09:23,693 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:09:23,719 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:09:23,720 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:09:23,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:09:23 BoogieIcfgContainer [2024-10-11 21:09:23,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:09:23,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:09:23,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:09:23,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:09:23,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:09:22" (1/3) ... [2024-10-11 21:09:23,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414526ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:09:23, skipping insertion in model container [2024-10-11 21:09:23,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:09:23" (2/3) ... [2024-10-11 21:09:23,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414526ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:09:23, skipping insertion in model container [2024-10-11 21:09:23,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:09:23" (3/3) ... [2024-10-11 21:09:23,726 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound100.c [2024-10-11 21:09:23,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:09:23,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-10-11 21:09:23,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:09:23,813 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;@22e67cc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:09:23,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-10-11 21:09:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 114 states have (on average 1.956140350877193) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:09:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:09:23,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:23,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:09:23,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:23,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 271673227, now seen corresponding path program 1 times [2024-10-11 21:09:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945797403] [2024-10-11 21:09:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945797403] [2024-10-11 21:09:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945797403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:23,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:09:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480750049] [2024-10-11 21:09:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:23,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:09:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:09:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:09:24,003 INFO L87 Difference]: Start difference. First operand has 223 states, 114 states have (on average 1.956140350877193) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:24,030 INFO L93 Difference]: Finished difference Result 419 states and 458 transitions. [2024-10-11 21:09:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:09:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 21:09:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:24,038 INFO L225 Difference]: With dead ends: 419 [2024-10-11 21:09:24,038 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 21:09:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 21:09:24,046 INFO L432 NwaCegarLoop]: 199 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, 199 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 21:09:24,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 21:09:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 21:09:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 113 states have (on average 1.7079646017699115) internal successors, (193), 191 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2024-10-11 21:09:24,140 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 5 [2024-10-11 21:09:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:24,147 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2024-10-11 21:09:24,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2024-10-11 21:09:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:09:24,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:24,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:09:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:09:24,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 271732809, now seen corresponding path program 1 times [2024-10-11 21:09:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468732655] [2024-10-11 21:09:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:24,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468732655] [2024-10-11 21:09:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468732655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:24,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:09:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620913683] [2024-10-11 21:09:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:24,271 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:24,312 INFO L93 Difference]: Finished difference Result 286 states and 288 transitions. [2024-10-11 21:09:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:09:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 21:09:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:24,314 INFO L225 Difference]: With dead ends: 286 [2024-10-11 21:09:24,314 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 21:09:24,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:24,315 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 4 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 572 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 21:09:24,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 572 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 21:09:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 21:09:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 195 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2024-10-11 21:09:24,329 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 5 [2024-10-11 21:09:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-10-11 21:09:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2024-10-11 21:09:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:09:24,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:24,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:24,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:09:24,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -821192215, now seen corresponding path program 1 times [2024-10-11 21:09:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687450740] [2024-10-11 21:09:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687450740] [2024-10-11 21:09:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687450740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:09:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539485604] [2024-10-11 21:09:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:24,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:09:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:09:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:24,363 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:24,673 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2024-10-11 21:09:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:09:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 21:09:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:24,675 INFO L225 Difference]: With dead ends: 359 [2024-10-11 21:09:24,675 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 21:09:24,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:24,676 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:24,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 136 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:09:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 21:09:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2024-10-11 21:09:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 206 states have (on average 1.4368932038834952) internal successors, (296), 284 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:09:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 302 transitions. [2024-10-11 21:09:24,686 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 302 transitions. Word has length 8 [2024-10-11 21:09:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 302 transitions. [2024-10-11 21:09:24,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 302 transitions. [2024-10-11 21:09:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 21:09:24,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:24,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:09:24,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1750947153, now seen corresponding path program 1 times [2024-10-11 21:09:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044365427] [2024-10-11 21:09:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044365427] [2024-10-11 21:09:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044365427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:09:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979893193] [2024-10-11 21:09:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:24,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:09:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:09:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:24,769 INFO L87 Difference]: Start difference. First operand 289 states and 302 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:24,825 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions. [2024-10-11 21:09:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:09:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 21:09:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:24,828 INFO L225 Difference]: With dead ends: 313 [2024-10-11 21:09:24,828 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 21:09:24,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:24,829 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:24,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 21:09:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288. [2024-10-11 21:09:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 205 states have (on average 1.4097560975609755) internal successors, (289), 283 states have internal predecessors, (289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:09:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 295 transitions. [2024-10-11 21:09:24,838 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 295 transitions. Word has length 46 [2024-10-11 21:09:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 295 transitions. [2024-10-11 21:09:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 295 transitions. [2024-10-11 21:09:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 21:09:24,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:24,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:09:24,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 966970257, now seen corresponding path program 1 times [2024-10-11 21:09:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630490047] [2024-10-11 21:09:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630490047] [2024-10-11 21:09:24,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630490047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:24,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398021524] [2024-10-11 21:09:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:24,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:24,926 INFO L87 Difference]: Start difference. First operand 288 states and 295 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:25,074 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2024-10-11 21:09:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 21:09:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:25,076 INFO L225 Difference]: With dead ends: 308 [2024-10-11 21:09:25,076 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 21:09:25,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 21:09:25,078 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 154 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:25,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 283 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:09:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 21:09:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-10-11 21:09:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 164 states have (on average 1.5) internal successors, (246), 242 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:09:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions. [2024-10-11 21:09:25,087 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 48 [2024-10-11 21:09:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:25,087 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions. [2024-10-11 21:09:25,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:09:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions. [2024-10-11 21:09:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 21:09:25,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:25,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:25,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:09:25,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:25,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 337766354, now seen corresponding path program 1 times [2024-10-11 21:09:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532626705] [2024-10-11 21:09:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532626705] [2024-10-11 21:09:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532626705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:09:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118820054] [2024-10-11 21:09:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:09:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:09:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:25,206 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:25,222 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2024-10-11 21:09:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:09:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2024-10-11 21:09:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:25,224 INFO L225 Difference]: With dead ends: 249 [2024-10-11 21:09:25,224 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 21:09:25,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:09:25,227 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 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 21:09:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 21:09:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-11 21:09:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 242 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:09:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions. [2024-10-11 21:09:25,244 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 56 [2024-10-11 21:09:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:25,245 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions. [2024-10-11 21:09:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions. [2024-10-11 21:09:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 21:09:25,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:25,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:25,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:09:25,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash -156389435, now seen corresponding path program 1 times [2024-10-11 21:09:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922055862] [2024-10-11 21:09:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578027098] [2024-10-11 21:09:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:25,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:25,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:25,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:09:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:25,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:09:25,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:25,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922055862] [2024-10-11 21:09:25,436 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578027098] [2024-10-11 21:09:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578027098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774474843] [2024-10-11 21:09:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:25,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:25,438 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:25,781 INFO L93 Difference]: Finished difference Result 427 states and 441 transitions. [2024-10-11 21:09:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:25,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2024-10-11 21:09:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:25,783 INFO L225 Difference]: With dead ends: 427 [2024-10-11 21:09:25,783 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 21:09:25,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:25,784 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:25,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 161 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:09:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 21:09:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2024-10-11 21:09:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 347 states have internal predecessors, (366), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 376 transitions. [2024-10-11 21:09:25,791 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 376 transitions. Word has length 61 [2024-10-11 21:09:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:25,791 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 376 transitions. [2024-10-11 21:09:25,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 376 transitions. [2024-10-11 21:09:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:09:25,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:25,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:25,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:09:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:25,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 72694558, now seen corresponding path program 1 times [2024-10-11 21:09:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706217654] [2024-10-11 21:09:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706217654] [2024-10-11 21:09:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706217654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840707170] [2024-10-11 21:09:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:26,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:26,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:26,066 INFO L87 Difference]: Start difference. First operand 354 states and 376 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:26,133 INFO L93 Difference]: Finished difference Result 355 states and 376 transitions. [2024-10-11 21:09:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:09:26,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-10-11 21:09:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:26,135 INFO L225 Difference]: With dead ends: 355 [2024-10-11 21:09:26,135 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:09:26,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:09:26,136 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 58 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:26,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:09:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:09:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 21:09:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 347 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions. [2024-10-11 21:09:26,142 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 68 [2024-10-11 21:09:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:26,142 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions. [2024-10-11 21:09:26,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions. [2024-10-11 21:09:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:09:26,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:26,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:26,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:09:26,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:26,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2041435827, now seen corresponding path program 1 times [2024-10-11 21:09:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789361165] [2024-10-11 21:09:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789361165] [2024-10-11 21:09:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789361165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763110619] [2024-10-11 21:09:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:26,213 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:26,278 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions. [2024-10-11 21:09:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:26,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-10-11 21:09:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:26,280 INFO L225 Difference]: With dead ends: 355 [2024-10-11 21:09:26,280 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:09:26,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:09:26,281 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 50 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:26,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 325 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:09:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:09:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 21:09:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 347 states have internal predecessors, (364), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2024-10-11 21:09:26,287 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 69 [2024-10-11 21:09:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:26,287 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2024-10-11 21:09:26,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2024-10-11 21:09:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 21:09:26,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:26,288 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:26,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:09:26,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:26,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 980225935, now seen corresponding path program 1 times [2024-10-11 21:09:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405480351] [2024-10-11 21:09:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405480351] [2024-10-11 21:09:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405480351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536750235] [2024-10-11 21:09:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:26,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:26,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:26,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:26,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:09:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:09:26,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:26,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536750235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:09:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110507821] [2024-10-11 21:09:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:09:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:09:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:09:26,516 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:26,538 INFO L93 Difference]: Finished difference Result 354 states and 374 transitions. [2024-10-11 21:09:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:26,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2024-10-11 21:09:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:26,539 INFO L225 Difference]: With dead ends: 354 [2024-10-11 21:09:26,539 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 21:09:26,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 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 21:09:26,540 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 378 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 21:09:26,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 21:09:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-10-11 21:09:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 269 states have (on average 1.345724907063197) internal successors, (362), 346 states have internal predecessors, (362), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 372 transitions. [2024-10-11 21:09:26,546 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 372 transitions. Word has length 71 [2024-10-11 21:09:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:26,547 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 372 transitions. [2024-10-11 21:09:26,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 372 transitions. [2024-10-11 21:09:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:09:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:26,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:26,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:09:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:26,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash 322232961, now seen corresponding path program 1 times [2024-10-11 21:09:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760266617] [2024-10-11 21:09:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760266617] [2024-10-11 21:09:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760266617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173525632] [2024-10-11 21:09:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:26,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:26,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:26,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:09:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:26,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:09:26,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:27,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173525632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:09:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743239660] [2024-10-11 21:09:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:27,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:09:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:09:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:09:27,005 INFO L87 Difference]: Start difference. First operand 353 states and 372 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:27,038 INFO L93 Difference]: Finished difference Result 483 states and 507 transitions. [2024-10-11 21:09:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:09:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-10-11 21:09:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:27,040 INFO L225 Difference]: With dead ends: 483 [2024-10-11 21:09:27,040 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 21:09:27,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:09:27,040 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 131 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:27,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 890 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 21:09:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2024-10-11 21:09:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 356 states have (on average 1.353932584269663) internal successors, (482), 434 states have internal predecessors, (482), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:09:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 496 transitions. [2024-10-11 21:09:27,049 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 496 transitions. Word has length 72 [2024-10-11 21:09:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 496 transitions. [2024-10-11 21:09:27,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 496 transitions. [2024-10-11 21:09:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:09:27,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:27,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:27,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:09:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:27,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1412016764, now seen corresponding path program 1 times [2024-10-11 21:09:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274728745] [2024-10-11 21:09:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274728745] [2024-10-11 21:09:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274728745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44913784] [2024-10-11 21:09:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:27,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:27,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:27,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:09:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:27,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:09:27,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:27,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44913784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:27,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:09:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-11 21:09:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280256672] [2024-10-11 21:09:27,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:27,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 21:09:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:27,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 21:09:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:09:27,550 INFO L87 Difference]: Start difference. First operand 442 states and 496 transitions. Second operand has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 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 21:09:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:27,639 INFO L93 Difference]: Finished difference Result 761 states and 804 transitions. [2024-10-11 21:09:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:09:27,639 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 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 112 [2024-10-11 21:09:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:27,642 INFO L225 Difference]: With dead ends: 761 [2024-10-11 21:09:27,642 INFO L226 Difference]: Without dead ends: 631 [2024-10-11 21:09:27,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 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 21:09:27,643 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 347 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:27,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1013 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-11 21:09:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 530. [2024-10-11 21:09:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 440 states have (on average 1.4636363636363636) internal successors, (644), 518 states have internal predecessors, (644), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:09:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 660 transitions. [2024-10-11 21:09:27,653 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 660 transitions. Word has length 112 [2024-10-11 21:09:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:27,653 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 660 transitions. [2024-10-11 21:09:27,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 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 21:09:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 660 transitions. [2024-10-11 21:09:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:09:27,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:27,654 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:27,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:09:27,855 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,SelfDestructingSolverStorable11 [2024-10-11 21:09:27,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1056395817, now seen corresponding path program 1 times [2024-10-11 21:09:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475775735] [2024-10-11 21:09:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447181231] [2024-10-11 21:09:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:27,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:27,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:09:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:27,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:09:27,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:28,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:28,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475775735] [2024-10-11 21:09:28,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447181231] [2024-10-11 21:09:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447181231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:28,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:09:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:09:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119904601] [2024-10-11 21:09:28,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:28,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:09:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:09:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:09:28,320 INFO L87 Difference]: Start difference. First operand 530 states and 660 transitions. Second operand has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:29,097 INFO L93 Difference]: Finished difference Result 544 states and 660 transitions. [2024-10-11 21:09:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:09:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2024-10-11 21:09:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:29,100 INFO L225 Difference]: With dead ends: 544 [2024-10-11 21:09:29,100 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 21:09:29,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:09:29,101 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 459 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:29,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 154 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:09:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 21:09:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-10-11 21:09:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 440 states have (on average 1.4272727272727272) internal successors, (628), 515 states have internal predecessors, (628), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:09:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 644 transitions. [2024-10-11 21:09:29,116 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 644 transitions. Word has length 112 [2024-10-11 21:09:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:29,116 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 644 transitions. [2024-10-11 21:09:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 644 transitions. [2024-10-11 21:09:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 21:09:29,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:29,117 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:29,130 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 21:09:29,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:09:29,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1584102539, now seen corresponding path program 1 times [2024-10-11 21:09:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655869141] [2024-10-11 21:09:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501284242] [2024-10-11 21:09:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:29,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:29,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:29,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:29,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:09:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:29,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:09:29,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:09:29,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:09:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:29,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655869141] [2024-10-11 21:09:29,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501284242] [2024-10-11 21:09:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501284242] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:29,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 21:09:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029837976] [2024-10-11 21:09:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:29,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:29,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:29,949 INFO L87 Difference]: Start difference. First operand 527 states and 644 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:39,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:45,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:45,102 INFO L93 Difference]: Finished difference Result 527 states and 644 transitions. [2024-10-11 21:09:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:09:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2024-10-11 21:09:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:45,105 INFO L225 Difference]: With dead ends: 527 [2024-10-11 21:09:45,105 INFO L226 Difference]: Without dead ends: 525 [2024-10-11 21:09:45,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:09:45,105 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:45,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 43 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 1 Unknown, 0 Unchecked, 15.1s Time] [2024-10-11 21:09:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-11 21:09:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2024-10-11 21:09:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 440 states have (on average 1.4113636363636364) internal successors, (621), 513 states have internal predecessors, (621), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:09:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 637 transitions. [2024-10-11 21:09:45,117 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 637 transitions. Word has length 114 [2024-10-11 21:09:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:45,117 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 637 transitions. [2024-10-11 21:09:45,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:09:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 637 transitions. [2024-10-11 21:09:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 21:09:45,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:45,118 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, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-10-11 21:09:45,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:09:45,319 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,SelfDestructingSolverStorable13 [2024-10-11 21:09:45,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:45,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -938541364, now seen corresponding path program 1 times [2024-10-11 21:09:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823585369] [2024-10-11 21:09:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 21:09:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823585369] [2024-10-11 21:09:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823585369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723153895] [2024-10-11 21:09:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:45,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:45,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:45,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:09:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:09:45,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:45,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:45,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723153895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:45,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:45,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:09:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415409668] [2024-10-11 21:09:45,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:45,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:45,544 INFO L87 Difference]: Start difference. First operand 525 states and 637 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:45,567 INFO L93 Difference]: Finished difference Result 561 states and 643 transitions. [2024-10-11 21:09:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-10-11 21:09:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:45,569 INFO L225 Difference]: With dead ends: 561 [2024-10-11 21:09:45,569 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 21:09:45,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:45,569 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 233 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:45,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 435 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 21:09:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 524. [2024-10-11 21:09:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 440 states have (on average 1.4045454545454545) internal successors, (618), 512 states have internal predecessors, (618), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:09:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 634 transitions. [2024-10-11 21:09:45,582 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 634 transitions. Word has length 122 [2024-10-11 21:09:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 634 transitions. [2024-10-11 21:09:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:09:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 634 transitions. [2024-10-11 21:09:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 21:09:45,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:45,584 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-10-11 21:09:45,596 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 21:09:45,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:45,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 969988935, now seen corresponding path program 1 times [2024-10-11 21:09:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602086573] [2024-10-11 21:09:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:09:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 21:09:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602086573] [2024-10-11 21:09:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602086573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709720155] [2024-10-11 21:09:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:45,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:45,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:09:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:45,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:09:45,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:46,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709720155] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:46,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:09:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 21:09:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732949748] [2024-10-11 21:09:46,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:46,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:09:46,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:09:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:46,114 INFO L87 Difference]: Start difference. First operand 524 states and 634 transitions. Second operand has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:46,147 INFO L93 Difference]: Finished difference Result 643 states and 712 transitions. [2024-10-11 21:09:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:09:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 123 [2024-10-11 21:09:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:46,149 INFO L225 Difference]: With dead ends: 643 [2024-10-11 21:09:46,149 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 21:09:46,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 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 21:09:46,150 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 118 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 650 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 21:09:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 570. [2024-10-11 21:09:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 485 states have (on average 1.4247422680412372) internal successors, (691), 557 states have internal predecessors, (691), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:09:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 709 transitions. [2024-10-11 21:09:46,164 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 709 transitions. Word has length 123 [2024-10-11 21:09:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:46,164 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 709 transitions. [2024-10-11 21:09:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 709 transitions. [2024-10-11 21:09:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 21:09:46,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:46,165 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:09:46,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:09:46,366 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,SelfDestructingSolverStorable15 [2024-10-11 21:09:46,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -468065013, now seen corresponding path program 1 times [2024-10-11 21:09:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756238043] [2024-10-11 21:09:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599987590] [2024-10-11 21:09:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:46,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:46,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:46,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:09:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:46,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:09:46,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:46,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756238043] [2024-10-11 21:09:46,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599987590] [2024-10-11 21:09:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599987590] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:46,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:09:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:09:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94998095] [2024-10-11 21:09:46,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:46,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:09:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:09:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:09:46,737 INFO L87 Difference]: Start difference. First operand 570 states and 709 transitions. Second operand has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 21:09:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:47,832 INFO L93 Difference]: Finished difference Result 619 states and 715 transitions. [2024-10-11 21:09:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:09:47,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 127 [2024-10-11 21:09:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:47,834 INFO L225 Difference]: With dead ends: 619 [2024-10-11 21:09:47,835 INFO L226 Difference]: Without dead ends: 554 [2024-10-11 21:09:47,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:09:47,835 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 558 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:47,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 158 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 21:09:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-11 21:09:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 548. [2024-10-11 21:09:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 481 states have (on average 1.2328482328482329) internal successors, (593), 536 states have internal predecessors, (593), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:09:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 611 transitions. [2024-10-11 21:09:47,847 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 611 transitions. Word has length 127 [2024-10-11 21:09:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:47,847 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 611 transitions. [2024-10-11 21:09:47,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 21:09:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 611 transitions. [2024-10-11 21:09:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 21:09:47,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:47,849 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:09:47,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:48,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:09:48,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:09:48,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash -43009901, now seen corresponding path program 1 times [2024-10-11 21:09:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324922148] [2024-10-11 21:09:48,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502719876] [2024-10-11 21:09:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:48,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:48,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:48,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:09:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:48,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 21:09:48,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:09:48,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 21:11:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:03,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324922148] [2024-10-11 21:11:03,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:03,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502719876] [2024-10-11 21:11:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502719876] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-11 21:11:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568798438] [2024-10-11 21:11:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:11:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:03,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:11:03,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2024-10-11 21:11:03,976 INFO L87 Difference]: Start difference. First operand 548 states and 611 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:11:08,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (* .cse0 10)) (.cse2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse3 (* 10 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (.cse4 (* |c_ULTIMATE.start_main_~y~0#1| 5)) (.cse5 (* 5 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)))) (and (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (< (+ .cse1 .cse2 .cse3 .cse4 .cse5) (+ 9223372036854775807 (div (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 5)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 12)))) (< (+ .cse1 .cse2 |c_ULTIMATE.start_main_~x~0#1| .cse3 .cse4 .cse5) 9223372036854775807)))) is different from false