./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/array-tiling/pnr5.c -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 c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:30:32,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:30:32,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:30:32,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:30:32,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:30:33,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:30:33,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:30:33,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:30:33,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:30:33,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:30:33,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:30:33,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:30:33,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:30:33,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:30:33,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:30:33,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:30:33,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:30:33,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:30:33,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:30:33,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:30:33,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:30:33,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:30:33,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:30:33,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:30:33,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:30:33,020 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:30:33,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:30:33,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:30:33,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:30:33,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:30:33,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:30:33,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:30:33,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:30:33,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:30:33,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:33,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:30:33,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:30:33,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:30:33,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:30:33,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:30:33,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:30:33,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:30:33,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:30:33,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:30:33,025 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2024-11-10 18:30:33,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:30:33,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:30:33,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:30:33,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:30:33,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:30:33,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr5.c [2024-11-10 18:30:34,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:30:35,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:30:35,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr5.c [2024-11-10 18:30:35,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53abe72e4/e96350fdfd1845368c2d2d93c994f020/FLAGd9a46e106 [2024-11-10 18:30:35,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53abe72e4/e96350fdfd1845368c2d2d93c994f020 [2024-11-10 18:30:35,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:30:35,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:30:35,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:35,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:30:35,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:30:35,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9c4cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35, skipping insertion in model container [2024-11-10 18:30:35,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:30:35,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:35,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:30:35,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:35,704 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:30:35,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35 WrapperNode [2024-11-10 18:30:35,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:35,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:35,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:30:35,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:30:35,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,759 INFO L138 Inliner]: procedures = 17, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-11-10 18:30:35,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:35,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:30:35,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:30:35,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:30:35,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,806 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 10 writes are split as follows [0, 0, 10]. [2024-11-10 18:30:35,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:30:35,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:30:35,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:30:35,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:30:35,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (1/1) ... [2024-11-10 18:30:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:35,869 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-11-10 18:30:35,872 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-11-10 18:30:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:30:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:30:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:30:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-10 18:30:35,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-10 18:30:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:30:35,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:30:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:30:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:30:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:30:36,066 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:30:36,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:30:36,437 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-10 18:30:36,437 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:30:36,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:30:36,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:30:36,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:36 BoogieIcfgContainer [2024-11-10 18:30:36,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:30:36,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:30:36,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:30:36,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:30:36,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:30:35" (1/3) ... [2024-11-10 18:30:36,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:36, skipping insertion in model container [2024-11-10 18:30:36,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:35" (2/3) ... [2024-11-10 18:30:36,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:36, skipping insertion in model container [2024-11-10 18:30:36,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:36" (3/3) ... [2024-11-10 18:30:36,477 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr5.c [2024-11-10 18:30:36,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:30:36,496 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-10 18:30:36,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:30:36,584 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;@20cac6d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:30:36,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-10 18:30:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:30:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:36,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:36,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:36,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 867124285, now seen corresponding path program 1 times [2024-11-10 18:30:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921931022] [2024-11-10 18:30:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:36,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921931022] [2024-11-10 18:30:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921931022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:36,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:36,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645818038] [2024-11-10 18:30:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:30:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:30:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:30:36,785 INFO L87 Difference]: Start difference. First operand has 143 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:36,813 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2024-11-10 18:30:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:30:36,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 18:30:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:36,823 INFO L225 Difference]: With dead ends: 280 [2024-11-10 18:30:36,823 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 18:30:36,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:30:36,830 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:36,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:30:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 18:30:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 18:30:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 84 states have (on average 1.619047619047619) internal successors, (136), 129 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:30:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-10 18:30:36,872 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 8 [2024-11-10 18:30:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:36,872 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-10 18:30:36,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-10 18:30:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:36,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:36,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:36,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:30:36,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:36,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash 867154076, now seen corresponding path program 1 times [2024-11-10 18:30:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:36,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750762524] [2024-11-10 18:30:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750762524] [2024-11-10 18:30:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750762524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:37,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:37,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891702099] [2024-11-10 18:30:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:37,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:37,248 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:37,323 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-10 18:30:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 18:30:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:37,326 INFO L225 Difference]: With dead ends: 136 [2024-11-10 18:30:37,326 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 18:30:37,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:37,328 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:37,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 138 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 18:30:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-10 18:30:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 128 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:30:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-10 18:30:37,341 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 8 [2024-11-10 18:30:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:37,342 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-10 18:30:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-10 18:30:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 18:30:37,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:37,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:37,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:30:37,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:37,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1111972691, now seen corresponding path program 1 times [2024-11-10 18:30:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719278827] [2024-11-10 18:30:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719278827] [2024-11-10 18:30:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719278827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:37,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:30:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717809696] [2024-11-10 18:30:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:37,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:30:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:30:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:30:37,567 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-10 18:30:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:37,708 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-10 18:30:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:30:37,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-10 18:30:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:37,710 INFO L225 Difference]: With dead ends: 135 [2024-11-10 18:30:37,710 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 18:30:37,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:30:37,712 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 522 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:37,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 137 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 18:30:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-10 18:30:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 127 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:30:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2024-11-10 18:30:37,728 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 9 [2024-11-10 18:30:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:37,728 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2024-11-10 18:30:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-10 18:30:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-11-10 18:30:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 18:30:37,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:37,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:30:37,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 547103026, now seen corresponding path program 1 times [2024-11-10 18:30:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:37,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793435934] [2024-11-10 18:30:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793435934] [2024-11-10 18:30:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793435934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:37,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278262726] [2024-11-10 18:30:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:37,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:37,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:37,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:37,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:37,814 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-11-10 18:30:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:37,981 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2024-11-10 18:30:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:37,982 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), 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 16 [2024-11-10 18:30:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:37,983 INFO L225 Difference]: With dead ends: 143 [2024-11-10 18:30:37,985 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 18:30:37,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-10 18:30:37,987 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:37,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 18:30:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-11-10 18:30:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 133 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:30:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2024-11-10 18:30:38,011 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 16 [2024-11-10 18:30:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:38,012 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2024-11-10 18:30:38,012 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), 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-11-10 18:30:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-11-10 18:30:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:30:38,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:38,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:30:38,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:38,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1665160005, now seen corresponding path program 1 times [2024-11-10 18:30:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320064496] [2024-11-10 18:30:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320064496] [2024-11-10 18:30:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320064496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620641265] [2024-11-10 18:30:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:38,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:30:38,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:30:38,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:38,084 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:30:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:38,306 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2024-11-10 18:30:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:30:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-10 18:30:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:38,310 INFO L225 Difference]: With dead ends: 250 [2024-11-10 18:30:38,310 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 18:30:38,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:38,311 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:38,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 134 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 18:30:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-10 18:30:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.368421052631579) internal successors, (208), 195 states have internal predecessors, (208), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:30:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-10 18:30:38,341 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 17 [2024-11-10 18:30:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:38,342 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-10 18:30:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:30:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-10 18:30:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:30:38,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:38,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:30:38,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1636713729, now seen corresponding path program 1 times [2024-11-10 18:30:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585806708] [2024-11-10 18:30:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:30:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:38,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585806708] [2024-11-10 18:30:38,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585806708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:38,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:30:38,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367770063] [2024-11-10 18:30:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:38,554 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-11-10 18:30:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:38,784 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2024-11-10 18:30:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 23 [2024-11-10 18:30:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:38,786 INFO L225 Difference]: With dead ends: 226 [2024-11-10 18:30:38,786 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 18:30:38,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:38,789 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 276 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:38,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 111 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 18:30:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-10 18:30:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.361842105263158) internal successors, (207), 195 states have internal predecessors, (207), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:30:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2024-11-10 18:30:38,801 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 23 [2024-11-10 18:30:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2024-11-10 18:30:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-11-10 18:30:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2024-11-10 18:30:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 18:30:38,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:38,804 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:30:38,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1409427580, now seen corresponding path program 1 times [2024-11-10 18:30:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743724097] [2024-11-10 18:30:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743724097] [2024-11-10 18:30:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743724097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:38,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008271368] [2024-11-10 18:30:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:38,970 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:39,158 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2024-11-10 18:30:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:39,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-10 18:30:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:39,160 INFO L225 Difference]: With dead ends: 215 [2024-11-10 18:30:39,160 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 18:30:39,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-11-10 18:30:39,162 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:39,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 216 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 18:30:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2024-11-10 18:30:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 200 states have internal predecessors, (212), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:30:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 232 transitions. [2024-11-10 18:30:39,172 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 232 transitions. Word has length 67 [2024-11-10 18:30:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:39,172 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 232 transitions. [2024-11-10 18:30:39,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 232 transitions. [2024-11-10 18:30:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 18:30:39,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:39,175 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:39,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:30:39,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -194630616, now seen corresponding path program 1 times [2024-11-10 18:30:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342125321] [2024-11-10 18:30:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342125321] [2024-11-10 18:30:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342125321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797414560] [2024-11-10 18:30:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:39,302 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-11-10 18:30:39,304 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-11-10 18:30:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:39,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:39,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:39,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797414560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 18:30:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074854960] [2024-11-10 18:30:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:39,535 INFO L87 Difference]: Start difference. First operand 212 states and 232 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 18:30:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:39,792 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2024-11-10 18:30:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:39,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2024-11-10 18:30:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:39,795 INFO L225 Difference]: With dead ends: 212 [2024-11-10 18:30:39,795 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 18:30:39,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:39,799 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 93 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:39,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 186 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 18:30:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-10 18:30:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.21656050955414) internal successors, (191), 179 states have internal predecessors, (191), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:30:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2024-11-10 18:30:39,810 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 80 [2024-11-10 18:30:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:39,811 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2024-11-10 18:30:39,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 18:30:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2024-11-10 18:30:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 18:30:39,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:39,817 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:39,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:40,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:40,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:40,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1738581708, now seen corresponding path program 1 times [2024-11-10 18:30:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022504220] [2024-11-10 18:30:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022504220] [2024-11-10 18:30:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022504220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991899280] [2024-11-10 18:30:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:40,162 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-11-10 18:30:40,164 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-11-10 18:30:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:40,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:40,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:40,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991899280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:40,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:40,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-10 18:30:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746319211] [2024-11-10 18:30:40,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:30:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:30:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:40,511 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 18:30:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:40,828 INFO L93 Difference]: Finished difference Result 279 states and 333 transitions. [2024-11-10 18:30:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:30:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 81 [2024-11-10 18:30:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:40,832 INFO L225 Difference]: With dead ends: 279 [2024-11-10 18:30:40,833 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 18:30:40,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 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-11-10 18:30:40,835 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 223 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:40,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 190 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 18:30:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-10 18:30:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 236 states have (on average 1.1016949152542372) internal successors, (260), 240 states have internal predecessors, (260), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 18:30:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 292 transitions. [2024-11-10 18:30:40,854 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 292 transitions. Word has length 81 [2024-11-10 18:30:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:40,854 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 292 transitions. [2024-11-10 18:30:40,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 18:30:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 292 transitions. [2024-11-10 18:30:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 18:30:40,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:40,859 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:40,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:30:41,059 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,SelfDestructingSolverStorable8 [2024-11-10 18:30:41,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 704388514, now seen corresponding path program 1 times [2024-11-10 18:30:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841986962] [2024-11-10 18:30:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:41,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841986962] [2024-11-10 18:30:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841986962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39453913] [2024-11-10 18:30:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:41,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:41,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:41,215 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-11-10 18:30:41,217 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-11-10 18:30:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:41,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:41,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39453913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:30:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673339248] [2024-11-10 18:30:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:30:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:30:41,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:41,349 INFO L87 Difference]: Start difference. First operand 258 states and 292 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:41,534 INFO L93 Difference]: Finished difference Result 259 states and 293 transitions. [2024-11-10 18:30:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:30:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2024-11-10 18:30:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:41,536 INFO L225 Difference]: With dead ends: 259 [2024-11-10 18:30:41,536 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 18:30:41,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:41,537 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 140 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:41,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 180 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 18:30:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2024-11-10 18:30:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.097457627118644) internal successors, (259), 239 states have internal predecessors, (259), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 18:30:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 291 transitions. [2024-11-10 18:30:41,552 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 291 transitions. Word has length 86 [2024-11-10 18:30:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:41,553 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 291 transitions. [2024-11-10 18:30:41,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 291 transitions. [2024-11-10 18:30:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 18:30:41,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:41,555 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:41,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:30:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:41,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 361207431, now seen corresponding path program 1 times [2024-11-10 18:30:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147847672] [2024-11-10 18:30:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147847672] [2024-11-10 18:30:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147847672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954394610] [2024-11-10 18:30:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:41,873 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-11-10 18:30:41,875 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-11-10 18:30:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:41,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:41,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:41,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954394610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:42,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:42,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:30:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163921321] [2024-11-10 18:30:42,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:42,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:30:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:30:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:30:42,059 INFO L87 Difference]: Start difference. First operand 257 states and 291 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:42,289 INFO L93 Difference]: Finished difference Result 279 states and 315 transitions. [2024-11-10 18:30:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:30:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2024-11-10 18:30:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:42,291 INFO L225 Difference]: With dead ends: 279 [2024-11-10 18:30:42,291 INFO L226 Difference]: Without dead ends: 278 [2024-11-10 18:30:42,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 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-11-10 18:30:42,293 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 256 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:42,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 171 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-10 18:30:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-10 18:30:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.0894941634241244) internal successors, (280), 260 states have internal predecessors, (280), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 18:30:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 312 transitions. [2024-11-10 18:30:42,306 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 312 transitions. Word has length 87 [2024-11-10 18:30:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:42,307 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 312 transitions. [2024-11-10 18:30:42,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 18:30:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 312 transitions. [2024-11-10 18:30:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 18:30:42,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:42,310 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:42,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:42,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1734417562, now seen corresponding path program 2 times [2024-11-10 18:30:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511775312] [2024-11-10 18:30:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:30:42,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511775312] [2024-11-10 18:30:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511775312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094555120] [2024-11-10 18:30:42,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:42,725 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-11-10 18:30:42,726 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-11-10 18:30:42,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:42,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:42,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:42,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 18:30:42,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 18:30:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094555120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:43,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-10 18:30:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024804680] [2024-11-10 18:30:43,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 18:30:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:43,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 18:30:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:30:43,088 INFO L87 Difference]: Start difference. First operand 278 states and 312 transitions. Second operand has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 18:30:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:43,464 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2024-11-10 18:30:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:30:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-10 18:30:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:43,466 INFO L225 Difference]: With dead ends: 288 [2024-11-10 18:30:43,466 INFO L226 Difference]: Without dead ends: 242 [2024-11-10 18:30:43,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-10 18:30:43,468 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 270 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:43,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 168 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-10 18:30:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-10 18:30:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 222 states have (on average 1.0855855855855856) internal successors, (241), 224 states have internal predecessors, (241), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 18:30:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2024-11-10 18:30:43,477 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 108 [2024-11-10 18:30:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:43,478 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2024-11-10 18:30:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 18:30:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2024-11-10 18:30:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 18:30:43,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:43,480 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:43,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:30:43,684 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,SelfDestructingSolverStorable11 [2024-11-10 18:30:43,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:43,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1107792734, now seen corresponding path program 1 times [2024-11-10 18:30:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434197847] [2024-11-10 18:30:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:30:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 18:30:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:30:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 18:30:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 18:30:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:30:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 18:30:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 18:30:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 18:30:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-10 18:30:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434197847] [2024-11-10 18:30:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434197847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:43,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:43,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477106524] [2024-11-10 18:30:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:43,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:43,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:43,808 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 18:30:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:43,891 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2024-11-10 18:30:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 194 [2024-11-10 18:30:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:43,893 INFO L225 Difference]: With dead ends: 242 [2024-11-10 18:30:43,893 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 18:30:43,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-11-10 18:30:43,894 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:43,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 18:30:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-10 18:30:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 222 states have (on average 1.0810810810810811) internal successors, (240), 223 states have internal predecessors, (240), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 18:30:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2024-11-10 18:30:43,905 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 194 [2024-11-10 18:30:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:43,905 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2024-11-10 18:30:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 18:30:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2024-11-10 18:30:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 18:30:43,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:43,908 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:43,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:30:43,908 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-10 18:30:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1212299052, now seen corresponding path program 2 times [2024-11-10 18:30:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755142532] [2024-11-10 18:30:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:30:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:30:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 18:30:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:30:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 18:30:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 18:30:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:30:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 18:30:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 18:30:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 18:30:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 18:30:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-10 18:30:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755142532] [2024-11-10 18:30:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755142532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5085959] [2024-11-10 18:30:44,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:44,428 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-11-10 18:30:44,429 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-11-10 18:30:44,521 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:44,521 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:44,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:44,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-10 18:30:45,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-10 18:30:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5085959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:45,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 10 [2024-11-10 18:30:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574194167] [2024-11-10 18:30:45,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:30:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:30:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:30:45,479 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 18:30:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:45,655 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-10 18:30:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:30:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 207 [2024-11-10 18:30:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:45,656 INFO L225 Difference]: With dead ends: 241 [2024-11-10 18:30:45,656 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:30:45,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:30:45,658 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 471 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:45,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:30:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:30:45,659 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-11-10 18:30:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:30:45,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2024-11-10 18:30:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:45,660 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:30:45,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 18:30:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:30:45,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:30:45,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2024-11-10 18:30:45,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2024-11-10 18:30:45,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2024-11-10 18:30:45,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2024-11-10 18:30:45,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2024-11-10 18:30:45,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2024-11-10 18:30:45,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2024-11-10 18:30:45,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2024-11-10 18:30:45,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2024-11-10 18:30:45,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2024-11-10 18:30:45,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2024-11-10 18:30:45,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2024-11-10 18:30:45,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:45,870 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-11-10 18:30:45,875 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:45,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:30:46,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:30:46,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:30:46 BoogieIcfgContainer [2024-11-10 18:30:46,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:30:46,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:30:46,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:30:46,324 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:30:46,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:36" (3/4) ... [2024-11-10 18:30:46,327 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:30:46,331 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-10 18:30:46,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-10 18:30:46,340 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 18:30:46,340 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:30:46,340 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:46,341 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:46,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:30:46,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:30:46,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:30:46,449 INFO L158 Benchmark]: Toolchain (without parser) took 11058.60ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 102.8MB in the beginning and 145.4MB in the end (delta: -42.6MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,450 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 176.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:30:46,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.79ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 89.3MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.56ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 87.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,450 INFO L158 Benchmark]: Boogie Preprocessor took 61.69ms. Allocated memory is still 176.2MB. Free memory was 87.4MB in the beginning and 85.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,450 INFO L158 Benchmark]: IcfgBuilder took 640.59ms. Allocated memory is still 176.2MB. Free memory was 85.3MB in the beginning and 129.8MB in the end (delta: -44.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,451 INFO L158 Benchmark]: TraceAbstraction took 9857.36ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 128.7MB in the beginning and 151.6MB in the end (delta: -22.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,451 INFO L158 Benchmark]: Witness Printer took 125.07ms. Allocated memory is still 308.3MB. Free memory was 151.6MB in the beginning and 145.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:30:46,452 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 176.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.79ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 89.3MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.56ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 87.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.69ms. Allocated memory is still 176.2MB. Free memory was 87.4MB in the beginning and 85.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 640.59ms. Allocated memory is still 176.2MB. Free memory was 85.3MB in the beginning and 129.8MB in the end (delta: -44.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9857.36ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 128.7MB in the beginning and 151.6MB in the end (delta: -22.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. * Witness Printer took 125.07ms. Allocated memory is still 308.3MB. Free memory was 151.6MB in the beginning and 145.4MB in the end (delta: 6.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: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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, 143 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2688 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2652 mSDsluCounter, 2235 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1087 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2517 IncrementalHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 1148 mSDtfsCounter, 2517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1246 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 6661 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1060 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 2605/2851 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 46 specifications checked. All of them hold - InvariantResult [Line: 89]: Location Invariant Derived location invariant: null - InvariantResult [Line: 36]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 18:30:46,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE