./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:12:45,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:12:45,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:12:45,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:12:45,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:12:45,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:12:45,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:12:45,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:12:45,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:12:45,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:12:45,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:12:45,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:12:45,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:12:45,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:12:45,130 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:12:45,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:12:45,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:12:45,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:12:45,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:12:45,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:12:45,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:12:45,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:12:45,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:12:45,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:12:45,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:12:45,139 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:12:45,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:12:45,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:12:45,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:12:45,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:12:45,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:12:45,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:45,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:12:45,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:12:45,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:12:45,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:12:45,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:12:45,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:12:45,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:12:45,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2024-10-13 13:12:45,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:12:45,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:12:45,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:12:45,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:12:45,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:12:45,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2024-10-13 13:12:46,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:12:46,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:12:46,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2024-10-13 13:12:46,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cd80e6e/db77ed5566c747ecab65fc9009e70d99/FLAG8939265d8 [2024-10-13 13:12:47,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cd80e6e/db77ed5566c747ecab65fc9009e70d99 [2024-10-13 13:12:47,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:12:47,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:12:47,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:47,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:12:47,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:12:47,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3089ea3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47, skipping insertion in model container [2024-10-13 13:12:47,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:12:47,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:47,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:12:47,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:47,533 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:12:47,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47 WrapperNode [2024-10-13 13:12:47,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:47,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:47,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:12:47,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:12:47,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,557 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-10-13 13:12:47,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:47,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:12:47,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:12:47,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:12:47,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,577 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-13 13:12:47,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:12:47,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:12:47,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:12:47,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:12:47,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (1/1) ... [2024-10-13 13:12:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:47,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:12:47,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:12:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:12:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:12:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:12:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:12:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:12:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:12:47,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:12:47,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:12:47,949 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 13:12:47,949 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:12:47,989 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:12:47,990 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:12:47,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:47 BoogieIcfgContainer [2024-10-13 13:12:47,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:12:47,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:12:47,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:12:47,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:12:47,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:12:47" (1/3) ... [2024-10-13 13:12:47,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c21dbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:47, skipping insertion in model container [2024-10-13 13:12:47,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:47" (2/3) ... [2024-10-13 13:12:47,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c21dbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:47, skipping insertion in model container [2024-10-13 13:12:48,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:47" (3/3) ... [2024-10-13 13:12:48,001 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build.i [2024-10-13 13:12:48,017 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:12:48,017 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-13 13:12:48,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:12:48,083 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;@28248084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:12:48,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 13:12:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 35 states have internal predecessors, (41), 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-13 13:12:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:12:48,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:12:48,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash 3316988, now seen corresponding path program 1 times [2024-10-13 13:12:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522271179] [2024-10-13 13:12:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,250 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-13 13:12:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522271179] [2024-10-13 13:12:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522271179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434562219] [2024-10-13 13:12:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:48,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:48,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:48,282 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 35 states have internal predecessors, (41), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:48,396 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2024-10-13 13:12:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:12:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 13:12:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:48,404 INFO L225 Difference]: With dead ends: 94 [2024-10-13 13:12:48,404 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 13:12:48,407 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-13 13:12:48,410 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:48,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 40 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 13:12:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2024-10-13 13:12:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 42 states have internal predecessors, (51), 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-13 13:12:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-13 13:12:48,443 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 4 [2024-10-13 13:12:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:48,443 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-13 13:12:48,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-10-13 13:12:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:12:48,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:12:48,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:12:48,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash 102825590, now seen corresponding path program 1 times [2024-10-13 13:12:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680922781] [2024-10-13 13:12:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,498 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-13 13:12:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680922781] [2024-10-13 13:12:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680922781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:48,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832784470] [2024-10-13 13:12:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:48,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:48,502 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 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-13 13:12:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:48,517 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2024-10-13 13:12:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:48,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-13 13:12:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:48,519 INFO L225 Difference]: With dead ends: 110 [2024-10-13 13:12:48,519 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 13:12:48,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 13:12:48,520 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:48,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 13:12:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2024-10-13 13:12:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 44 states have internal predecessors, (53), 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-13 13:12:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-13 13:12:48,529 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 5 [2024-10-13 13:12:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:48,529 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-13 13:12:48,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-13 13:12:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-13 13:12:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:12:48,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:12:48,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:12:48,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash 102826680, now seen corresponding path program 1 times [2024-10-13 13:12:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554101461] [2024-10-13 13:12:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,555 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-13 13:12:48,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554101461] [2024-10-13 13:12:48,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554101461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:48,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:48,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:12:48,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925153686] [2024-10-13 13:12:48,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:48,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:48,557 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 3 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-13 13:12:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:48,611 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-10-13 13:12:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:48,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-13 13:12:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:48,612 INFO L225 Difference]: With dead ends: 50 [2024-10-13 13:12:48,612 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 13:12:48,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 13:12:48,614 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:48,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 13:12:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 13:12:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4) internal successors, (49), 42 states have internal predecessors, (49), 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-13 13:12:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-10-13 13:12:48,621 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 5 [2024-10-13 13:12:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:48,621 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-10-13 13:12:48,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-13 13:12:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-10-13 13:12:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 13:12:48,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:48,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:12:48,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 32193402, now seen corresponding path program 1 times [2024-10-13 13:12:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434675788] [2024-10-13 13:12:48,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,664 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-13 13:12:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434675788] [2024-10-13 13:12:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434675788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:48,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:48,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:12:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900808105] [2024-10-13 13:12:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:48,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:48,667 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:48,700 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-10-13 13:12:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 13:12:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:48,701 INFO L225 Difference]: With dead ends: 53 [2024-10-13 13:12:48,701 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 13:12:48,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 13:12:48,702 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:48,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 13:12:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-10-13 13:12:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 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-13 13:12:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-10-13 13:12:48,711 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 7 [2024-10-13 13:12:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-10-13 13:12:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-10-13 13:12:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:12:48,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,712 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] [2024-10-13 13:12:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:12:48,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -102933796, now seen corresponding path program 1 times [2024-10-13 13:12:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659044403] [2024-10-13 13:12:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:12:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659044403] [2024-10-13 13:12:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659044403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68614242] [2024-10-13 13:12:48,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:48,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:48,812 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:48,839 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-10-13 13:12:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:48,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-13 13:12:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:48,841 INFO L225 Difference]: With dead ends: 80 [2024-10-13 13:12:48,841 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 13:12:48,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:48,842 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:48,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 13:12:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-10-13 13:12:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:12:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2024-10-13 13:12:48,852 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 23 [2024-10-13 13:12:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2024-10-13 13:12:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2024-10-13 13:12:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:12:48,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:48,853 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] [2024-10-13 13:12:48,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:12:48,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:48,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1008861756, now seen corresponding path program 1 times [2024-10-13 13:12:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138212427] [2024-10-13 13:12:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:12:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138212427] [2024-10-13 13:12:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138212427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738203497] [2024-10-13 13:12:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:48,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:48,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:48,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:12:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:49,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:12:49,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:12:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738203497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:49,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 13:12:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585660363] [2024-10-13 13:12:49,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:12:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:12:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:12:49,190 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:12:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,276 INFO L93 Difference]: Finished difference Result 156 states and 187 transitions. [2024-10-13 13:12:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:12:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2024-10-13 13:12:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,282 INFO L225 Difference]: With dead ends: 156 [2024-10-13 13:12:49,282 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 13:12:49,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:12:49,284 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 13:12:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-10-13 13:12:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 90 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:12:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2024-10-13 13:12:49,310 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 27 [2024-10-13 13:12:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,310 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2024-10-13 13:12:49,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:12:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2024-10-13 13:12:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 13:12:49,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 13:12:49,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:12:49,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 13:12:49,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:49,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1578999126, now seen corresponding path program 1 times [2024-10-13 13:12:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864873784] [2024-10-13 13:12:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 13:12:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864873784] [2024-10-13 13:12:49,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864873784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527803467] [2024-10-13 13:12:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:49,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:49,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:12:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:49,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 13:12:49,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:12:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527803467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:12:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-13 13:12:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978493596] [2024-10-13 13:12:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:12:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:12:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:12:49,782 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:12:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,811 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2024-10-13 13:12:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-10-13 13:12:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,813 INFO L225 Difference]: With dead ends: 104 [2024-10-13 13:12:49,815 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 13:12:49,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:12:49,816 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 13:12:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 13:12:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.216867469879518) internal successors, (101), 89 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:12:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2024-10-13 13:12:49,833 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 45 [2024-10-13 13:12:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,833 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2024-10-13 13:12:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:12:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2024-10-13 13:12:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 13:12:49,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,838 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2024-10-13 13:12:49,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:12:50,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-13 13:12:50,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:50,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1863449776, now seen corresponding path program 1 times [2024-10-13 13:12:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381620038] [2024-10-13 13:12:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-13 13:12:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381620038] [2024-10-13 13:12:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381620038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:50,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259490366] [2024-10-13 13:12:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:50,149 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:12:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:50,169 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2024-10-13 13:12:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2024-10-13 13:12:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:50,172 INFO L225 Difference]: With dead ends: 103 [2024-10-13 13:12:50,172 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 13:12:50,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-13 13:12:50,173 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:50,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 13:12:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 13:12:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 88 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:12:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-10-13 13:12:50,196 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 68 [2024-10-13 13:12:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:50,197 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-10-13 13:12:50,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:12:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-10-13 13:12:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 13:12:50,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:50,198 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-10-13 13:12:50,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:12:50,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:50,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1579929376, now seen corresponding path program 2 times [2024-10-13 13:12:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867781688] [2024-10-13 13:12:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 13:12:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867781688] [2024-10-13 13:12:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867781688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816589156] [2024-10-13 13:12:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:50,283 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:50,314 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2024-10-13 13:12:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-10-13 13:12:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:50,317 INFO L225 Difference]: With dead ends: 107 [2024-10-13 13:12:50,317 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 13:12:50,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-13 13:12:50,318 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:50,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 13:12:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 13:12:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.186046511627907) internal successors, (102), 91 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:12:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2024-10-13 13:12:50,327 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 71 [2024-10-13 13:12:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:50,327 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-10-13 13:12:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2024-10-13 13:12:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 13:12:50,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:50,329 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:50,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:12:50,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -231605572, now seen corresponding path program 1 times [2024-10-13 13:12:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188698256] [2024-10-13 13:12:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 13:12:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188698256] [2024-10-13 13:12:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188698256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:50,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248890127] [2024-10-13 13:12:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:50,373 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:50,391 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-10-13 13:12:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-10-13 13:12:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:50,392 INFO L225 Difference]: With dead ends: 105 [2024-10-13 13:12:50,392 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 13:12:50,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-13 13:12:50,393 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:50,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 13:12:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 13:12:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 89 states have internal predecessors, (96), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:12:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2024-10-13 13:12:50,399 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 77 [2024-10-13 13:12:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2024-10-13 13:12:50,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2024-10-13 13:12:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 13:12:50,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:50,400 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:12:50,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1410161916, now seen corresponding path program 1 times [2024-10-13 13:12:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930787496] [2024-10-13 13:12:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930787496] [2024-10-13 13:12:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930787496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542109358] [2024-10-13 13:12:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:50,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:50,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:12:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 13:12:50,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542109358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:50,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-13 13:12:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234554724] [2024-10-13 13:12:50,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 13:12:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 13:12:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:12:50,813 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 13:12:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:50,894 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2024-10-13 13:12:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 13:12:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 78 [2024-10-13 13:12:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:50,896 INFO L225 Difference]: With dead ends: 285 [2024-10-13 13:12:50,896 INFO L226 Difference]: Without dead ends: 227 [2024-10-13 13:12:50,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:12:50,897 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:50,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 128 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-13 13:12:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2024-10-13 13:12:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.098901098901099) internal successors, (200), 185 states have internal predecessors, (200), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 13:12:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 256 transitions. [2024-10-13 13:12:50,918 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 256 transitions. Word has length 78 [2024-10-13 13:12:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:50,918 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 256 transitions. [2024-10-13 13:12:50,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 13:12:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 256 transitions. [2024-10-13 13:12:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 13:12:50,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:50,924 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:50,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:12:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:51,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -719948348, now seen corresponding path program 2 times [2024-10-13 13:12:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:51,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906353712] [2024-10-13 13:12:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 13:12:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 13:12:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 13:12:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 13:12:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:12:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 13:12:51,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906353712] [2024-10-13 13:12:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906353712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663405102] [2024-10-13 13:12:51,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:12:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:51,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:12:51,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:12:51,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:51,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 13:12:51,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 13:12:51,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 13:12:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663405102] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:51,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2024-10-13 13:12:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916007476] [2024-10-13 13:12:51,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:12:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:51,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:12:51,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:12:51,909 INFO L87 Difference]: Start difference. First operand 215 states and 256 transitions. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 13:12:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:51,995 INFO L93 Difference]: Finished difference Result 371 states and 432 transitions. [2024-10-13 13:12:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 13:12:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 166 [2024-10-13 13:12:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:51,998 INFO L225 Difference]: With dead ends: 371 [2024-10-13 13:12:51,998 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 13:12:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 343 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:12:51,999 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:52,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 216 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 13:12:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 243. [2024-10-13 13:12:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.0970873786407767) internal successors, (226), 209 states have internal predecessors, (226), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 13:12:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2024-10-13 13:12:52,013 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 166 [2024-10-13 13:12:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:52,014 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2024-10-13 13:12:52,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 13:12:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2024-10-13 13:12:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 13:12:52,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:52,016 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:52,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:12:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:52,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2117470154, now seen corresponding path program 3 times [2024-10-13 13:12:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773022869] [2024-10-13 13:12:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 13:12:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 13:12:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 13:12:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 13:12:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:12:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 13:12:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 13:12:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-10-13 13:12:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773022869] [2024-10-13 13:12:52,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773022869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365200026] [2024-10-13 13:12:52,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:12:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:52,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:52,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:52,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:12:52,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 13:12:52,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:52,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:12:52,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-10-13 13:12:52,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:12:52,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365200026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:52,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:12:52,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 13:12:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374539606] [2024-10-13 13:12:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:12:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:12:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:12:52,762 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:52,818 INFO L93 Difference]: Finished difference Result 243 states and 290 transitions. [2024-10-13 13:12:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:12:52,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 188 [2024-10-13 13:12:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:52,820 INFO L225 Difference]: With dead ends: 243 [2024-10-13 13:12:52,820 INFO L226 Difference]: Without dead ends: 240 [2024-10-13 13:12:52,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:12:52,821 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:52,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 57 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-13 13:12:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-13 13:12:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 206 states have (on average 1.0145631067961165) internal successors, (209), 206 states have internal predecessors, (209), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 13:12:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2024-10-13 13:12:52,835 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 188 [2024-10-13 13:12:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:52,836 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2024-10-13 13:12:52,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:12:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2024-10-13 13:12:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-13 13:12:52,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:52,840 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 2, 1, 1, 1] [2024-10-13 13:12:52,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:12:53,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 13:12:53,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1157997074, now seen corresponding path program 1 times [2024-10-13 13:12:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704547992] [2024-10-13 13:12:53,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 13:12:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 13:12:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 13:12:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 13:12:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:12:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 13:12:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 13:12:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-13 13:12:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 13:12:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-13 13:12:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 13:12:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-13 13:12:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 13:12:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-13 13:12:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-13 13:12:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-13 13:12:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-13 13:12:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-10-13 13:12:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-13 13:12:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-13 13:12:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-13 13:12:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-13 13:12:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-10-13 13:12:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-10-13 13:12:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704547992] [2024-10-13 13:12:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704547992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72343780] [2024-10-13 13:12:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:53,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:53,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:12:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:53,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:12:53,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-10-13 13:12:53,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-10-13 13:12:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72343780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:54,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 13:12:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447104271] [2024-10-13 13:12:54,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:54,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:12:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:12:54,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:12:54,014 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-13 13:12:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:54,085 INFO L93 Difference]: Finished difference Result 592 states and 678 transitions. [2024-10-13 13:12:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:12:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 363 [2024-10-13 13:12:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:54,088 INFO L225 Difference]: With dead ends: 592 [2024-10-13 13:12:54,088 INFO L226 Difference]: Without dead ends: 591 [2024-10-13 13:12:54,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:12:54,089 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:54,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-13 13:12:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-10-13 13:12:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 509 states have (on average 1.0117878192534382) internal successors, (515), 509 states have internal predecessors, (515), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 13:12:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 675 transitions. [2024-10-13 13:12:54,113 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 675 transitions. Word has length 363 [2024-10-13 13:12:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:54,113 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 675 transitions. [2024-10-13 13:12:54,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-13 13:12:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 675 transitions. [2024-10-13 13:12:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2024-10-13 13:12:54,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:54,126 INFO L215 NwaCegarLoop]: trace histogram [80, 80, 80, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 5, 5, 5, 5, 4, 1, 1] [2024-10-13 13:12:54,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:12:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:54,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 13:12:54,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash -54460630, now seen corresponding path program 2 times [2024-10-13 13:12:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760718618] [2024-10-13 13:12:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:54,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 13:12:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 13:12:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:12:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:12:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 13:12:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 13:12:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 13:12:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 13:12:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 13:12:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:12:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 13:12:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 13:12:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-13 13:12:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 13:12:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-13 13:12:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 13:12:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-13 13:12:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 13:12:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-13 13:12:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-13 13:12:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-13 13:12:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-13 13:12:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-10-13 13:12:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-13 13:12:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-13 13:12:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-13 13:12:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-13 13:12:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-10-13 13:12:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-10-13 13:12:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-10-13 13:12:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2024-10-13 13:12:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-10-13 13:12:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-10-13 13:12:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2024-10-13 13:12:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 435 [2024-10-13 13:12:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2024-10-13 13:12:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-10-13 13:12:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2024-10-13 13:12:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-10-13 13:12:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2024-10-13 13:12:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2024-10-13 13:12:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-10-13 13:12:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-10-13 13:12:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2024-10-13 13:12:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-10-13 13:12:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-10-13 13:12:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2024-10-13 13:12:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2024-10-13 13:12:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 594 [2024-10-13 13:12:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2024-10-13 13:12:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 616 [2024-10-13 13:12:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 625 [2024-10-13 13:12:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2024-10-13 13:12:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-10-13 13:12:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 660 [2024-10-13 13:12:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-13 13:12:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2024-10-13 13:12:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 691 [2024-10-13 13:12:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-10-13 13:12:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2024-10-13 13:12:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 731 [2024-10-13 13:12:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 740 [2024-10-13 13:12:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 753 [2024-10-13 13:12:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 762 [2024-10-13 13:12:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-10-13 13:12:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 784 [2024-10-13 13:12:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 797 [2024-10-13 13:12:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 806 [2024-10-13 13:12:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2024-10-13 13:12:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 828 [2024-10-13 13:12:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 841 [2024-10-13 13:12:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 850 [2024-10-13 13:12:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 863 [2024-10-13 13:12:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 872 [2024-10-13 13:12:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 885 [2024-10-13 13:12:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 894 [2024-10-13 13:12:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 9170 refuted. 0 times theorem prover too weak. 14640 trivial. 0 not checked. [2024-10-13 13:12:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760718618] [2024-10-13 13:12:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760718618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979889322] [2024-10-13 13:12:55,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:12:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:55,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:55,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:12:55,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 13:12:55,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:55,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:55,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 3664 refuted. 0 times theorem prover too weak. 20146 trivial. 0 not checked. [2024-10-13 13:12:55,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 3664 refuted. 0 times theorem prover too weak. 20146 trivial. 0 not checked. [2024-10-13 13:12:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979889322] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:57,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-10-13 13:12:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622685956] [2024-10-13 13:12:57,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:12:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:12:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:12:57,021 INFO L87 Difference]: Start difference. First operand 591 states and 675 transitions. Second operand has 15 states, 14 states have (on average 8.857142857142858) internal successors, (124), 15 states have internal predecessors, (124), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 13:12:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:57,221 INFO L93 Difference]: Finished difference Result 709 states and 811 transitions. [2024-10-13 13:12:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 13:12:57,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.857142857142858) internal successors, (124), 15 states have internal predecessors, (124), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 906 [2024-10-13 13:12:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:57,223 INFO L225 Difference]: With dead ends: 709 [2024-10-13 13:12:57,223 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:12:57,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1992 GetRequests, 1965 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-13 13:12:57,224 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:57,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:12:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:12:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:12:57,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 906 [2024-10-13 13:12:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:57,225 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:12:57,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.857142857142858) internal successors, (124), 15 states have internal predecessors, (124), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 13:12:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:12:57,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-13 13:12:57,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-13 13:12:57,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-13 13:12:57,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-13 13:12:57,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-13 13:12:57,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-13 13:12:57,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-13 13:12:57,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:12:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:57,432 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:57,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:12:58,686 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:12:58,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:12:58 BoogieIcfgContainer [2024-10-13 13:12:58,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:12:58,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:12:58,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:12:58,699 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:12:58,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:47" (3/4) ... [2024-10-13 13:12:58,701 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:12:58,704 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:12:58,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 13:12:58,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 13:12:58,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:12:58,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:12:58,767 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:12:58,767 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:12:58,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:12:58,768 INFO L158 Benchmark]: Toolchain (without parser) took 11427.39ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 88.7MB in the beginning and 305.2MB in the end (delta: -216.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:58,768 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:58,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.63ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 76.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:12:58,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.90ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:12:58,769 INFO L158 Benchmark]: Boogie Preprocessor took 27.89ms. Allocated memory is still 159.4MB. Free memory was 75.1MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:58,769 INFO L158 Benchmark]: RCFGBuilder took 404.10ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 73.4MB in the beginning and 220.1MB in the end (delta: -146.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-13 13:12:58,769 INFO L158 Benchmark]: TraceAbstraction took 10704.54ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 220.1MB in the beginning and 310.4MB in the end (delta: -90.3MB). Peak memory consumption was 221.1MB. Max. memory is 16.1GB. [2024-10-13 13:12:58,769 INFO L158 Benchmark]: Witness Printer took 68.56ms. Allocated memory is still 369.1MB. Free memory was 310.4MB in the beginning and 305.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:12:58,770 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.63ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 76.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.90ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.89ms. Allocated memory is still 159.4MB. Free memory was 75.1MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.10ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 73.4MB in the beginning and 220.1MB in the end (delta: -146.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10704.54ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 220.1MB in the beginning and 310.4MB in the end (delta: -90.3MB). Peak memory consumption was 221.1MB. Max. memory is 16.1GB. * Witness Printer took 68.56ms. Allocated memory is still 369.1MB. Free memory was 310.4MB in the beginning and 305.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 15, TraceHistogramMax: 80, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 1139 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 805 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 334 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3732 GetRequests, 3613 SyntacticMatches, 17 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=14, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3806 NumberOfCodeBlocks, 2730 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5319 ConstructedInterpolants, 0 QuantifiedInterpolants, 12961 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1191 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 66923/87268 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((0 <= (j + 2147483648)) && (1 <= nlen)) && (i == 0)) && (nlen <= 2147483647)) || ((((0 <= (j + 2147483648)) && (1 <= i)) && (nlen <= 2147483647)) && (((long long) i + 1) <= nlen))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((i == 0) && (nlen <= 2147483647)) || (((1 <= nlen) && (1 <= i)) && (nlen <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:12:58,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE