./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:44:47,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:44:47,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:44:47,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:44:47,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:44:47,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:44:47,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:44:47,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:44:47,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:44:47,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:44:47,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:44:47,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:44:47,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:44:47,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:44:47,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:44:47,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:44:47,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:44:47,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:44:47,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:44:47,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:44:47,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:44:47,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:44:47,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:44:47,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:44:47,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:44:47,980 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:44:47,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:44:47,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:44:47,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:44:47,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:44:47,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:47,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:44:47,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:44:47,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:44:47,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:44:47,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:44:47,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:44:47,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:44:47,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:44:47,984 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-10 19:44:48,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:44:48,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:44:48,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:44:48,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:44:48,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:44:48,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 19:44:49,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:44:49,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:44:49,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 19:44:49,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548d28bac/ad21a3714e424ff7ab367fc642743c07/FLAGba3e1346a [2024-11-10 19:44:49,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548d28bac/ad21a3714e424ff7ab367fc642743c07 [2024-11-10 19:44:49,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:44:49,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:44:49,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:49,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:44:49,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:44:49,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698e5df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49, skipping insertion in model container [2024-11-10 19:44:49,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:44:49,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:49,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:44:49,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:49,901 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:44:49,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49 WrapperNode [2024-11-10 19:44:49,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:49,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:49,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:44:49,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:44:49,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,929 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-11-10 19:44:49,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:49,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:44:49,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:44:49,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:44:49,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,981 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 19:44:49,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:49,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:44:49,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:44:49,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:44:49,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:44:50,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (1/1) ... [2024-11-10 19:44:50,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:50,049 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 19:44:50,059 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 19:44:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:44:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:44:50,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:44:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:44:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 19:44:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-10 19:44:50,095 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-10 19:44:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 19:44:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:44:50,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:44:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 19:44:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 19:44:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:44:50,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:44:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:44:50,161 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:44:50,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:44:50,283 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 19:44:50,283 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:44:50,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:44:50,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:44:50,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:50 BoogieIcfgContainer [2024-11-10 19:44:50,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:44:50,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:44:50,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:44:50,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:44:50,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:44:49" (1/3) ... [2024-11-10 19:44:50,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2cfd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:50, skipping insertion in model container [2024-11-10 19:44:50,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:49" (2/3) ... [2024-11-10 19:44:50,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2cfd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:50, skipping insertion in model container [2024-11-10 19:44:50,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:50" (3/3) ... [2024-11-10 19:44:50,307 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-10 19:44:50,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:44:50,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 19:44:50,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:44:50,377 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;@791f8596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:44:50,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 19:44:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:44:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:44:50,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:50,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:50,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1863574553, now seen corresponding path program 1 times [2024-11-10 19:44:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295696773] [2024-11-10 19:44:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295696773] [2024-11-10 19:44:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295696773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:50,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:50,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:44:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614256382] [2024-11-10 19:44:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:44:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:50,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:44:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:44:50,569 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:50,589 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-11-10 19:44:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:44:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-10 19:44:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:50,595 INFO L225 Difference]: With dead ends: 94 [2024-11-10 19:44:50,596 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 19:44:50,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:44:50,602 INFO L432 NwaCegarLoop]: 54 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, 54 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 19:44:50,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 19:44:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 19:44:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:44:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-10 19:44:50,628 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 16 [2024-11-10 19:44:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-10 19:44:50,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-10 19:44:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:44:50,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:50,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:44:50,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:50,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1705862683, now seen corresponding path program 1 times [2024-11-10 19:44:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151659844] [2024-11-10 19:44:50,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:44:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151659844] [2024-11-10 19:44:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151659844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140756779] [2024-11-10 19:44:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:50,861 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 19:44:50,866 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 19:44:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:44:50,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:44:51,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:44:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140756779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:51,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:44:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2024-11-10 19:44:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417741620] [2024-11-10 19:44:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:51,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:44:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:44:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:51,004 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:51,064 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-10 19:44:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:44:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-10 19:44:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:51,067 INFO L225 Difference]: With dead ends: 37 [2024-11-10 19:44:51,067 INFO L226 Difference]: Without dead ends: 35 [2024-11-10 19:44:51,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:44:51,068 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-10 19:44:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-10 19:44:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:44:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-10 19:44:51,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2024-11-10 19:44:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:51,076 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-10 19:44:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-10 19:44:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 19:44:51,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:51,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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 19:44:51,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:44:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:51,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1837964732, now seen corresponding path program 1 times [2024-11-10 19:44:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639463187] [2024-11-10 19:44:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:44:51,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639463187] [2024-11-10 19:44:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639463187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:44:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660825617] [2024-11-10 19:44:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:44:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:44:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:51,402 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:51,481 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-10 19:44:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:44:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-10 19:44:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:51,486 INFO L225 Difference]: With dead ends: 53 [2024-11-10 19:44:51,486 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 19:44:51,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:44:51,487 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:51,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 153 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:51,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 19:44:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2024-11-10 19:44:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 34 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-10 19:44:51,503 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 33 [2024-11-10 19:44:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:51,504 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-10 19:44:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-10 19:44:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 19:44:51,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:51,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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 19:44:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:44:51,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:51,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1837964540, now seen corresponding path program 1 times [2024-11-10 19:44:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029109718] [2024-11-10 19:44:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:44:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029109718] [2024-11-10 19:44:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029109718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:44:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613107039] [2024-11-10 19:44:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:51,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:44:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:44:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:44:51,582 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:51,623 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-10 19:44:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:44:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-10 19:44:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:51,624 INFO L225 Difference]: With dead ends: 52 [2024-11-10 19:44:51,625 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 19:44:51,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:51,626 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:51,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 124 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 19:44:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-10 19:44:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-10 19:44:51,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 33 [2024-11-10 19:44:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:51,636 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-10 19:44:51,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-10 19:44:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:44:51,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:51,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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 19:44:51,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:44:51,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1142331847, now seen corresponding path program 1 times [2024-11-10 19:44:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396917875] [2024-11-10 19:44:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:44:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396917875] [2024-11-10 19:44:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396917875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:44:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293090148] [2024-11-10 19:44:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:44:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:44:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:44:51,737 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:51,783 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-10 19:44:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:44:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-10 19:44:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:51,784 INFO L225 Difference]: With dead ends: 47 [2024-11-10 19:44:51,785 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 19:44:51,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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 19:44:51,785 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:51,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 19:44:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 19:44:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-10 19:44:51,799 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 34 [2024-11-10 19:44:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:51,799 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-10 19:44:51,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:44:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-10 19:44:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 19:44:51,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:51,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:51,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:44:51,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:51,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2043692972, now seen corresponding path program 1 times [2024-11-10 19:44:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:51,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799411186] [2024-11-10 19:44:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:44:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:44:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799411186] [2024-11-10 19:44:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799411186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107715032] [2024-11-10 19:44:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:51,988 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 19:44:52,010 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 19:44:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:44:52,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:52,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107715032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:52,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:52,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-10 19:44:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444094873] [2024-11-10 19:44:52,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:52,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 19:44:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 19:44:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:44:52,293 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 19:44:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:52,512 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-10 19:44:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 19:44:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 51 [2024-11-10 19:44:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:52,515 INFO L225 Difference]: With dead ends: 49 [2024-11-10 19:44:52,515 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 19:44:52,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:44:52,516 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:52,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 243 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 19:44:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-10 19:44:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-10 19:44:52,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 51 [2024-11-10 19:44:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:52,527 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-10 19:44:52,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 19:44:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-10 19:44:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 19:44:52,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:52,528 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:52,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:44:52,728 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,SelfDestructingSolverStorable5 [2024-11-10 19:44:52,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1070033263, now seen corresponding path program 1 times [2024-11-10 19:44:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438914530] [2024-11-10 19:44:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:44:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:44:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438914530] [2024-11-10 19:44:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438914530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160677407] [2024-11-10 19:44:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:52,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:52,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:52,822 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 19:44:52,823 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 19:44:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:52,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:44:52,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:52,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:44:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160677407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:52,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-10 19:44:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538173112] [2024-11-10 19:44:52,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 19:44:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 19:44:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:44:53,001 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:44:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:53,147 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2024-11-10 19:44:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 19:44:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 52 [2024-11-10 19:44:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:53,149 INFO L225 Difference]: With dead ends: 89 [2024-11-10 19:44:53,149 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 19:44:53,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-11-10 19:44:53,150 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 103 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:53,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 207 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 19:44:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-10 19:44:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2024-11-10 19:44:53,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 52 [2024-11-10 19:44:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2024-11-10 19:44:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:44:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2024-11-10 19:44:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 19:44:53,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:53,160 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:53,174 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 19:44:53,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:53,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1188657857, now seen corresponding path program 2 times [2024-11-10 19:44:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:53,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956995560] [2024-11-10 19:44:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:44:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:44:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 19:44:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 19:44:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 19:44:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:44:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:44:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 19:44:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-10 19:44:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956995560] [2024-11-10 19:44:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956995560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880839145] [2024-11-10 19:44:53,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:44:53,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:53,664 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 19:44:53,665 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 19:44:53,742 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:44:53,743 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:44:53,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 19:44:53,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-10 19:44:53,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-10 19:44:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880839145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:54,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-11-10 19:44:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579305930] [2024-11-10 19:44:54,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:54,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 19:44:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:54,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 19:44:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 19:44:54,161 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 24 states have internal predecessors, (88), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-10 19:44:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:54,662 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2024-11-10 19:44:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-10 19:44:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 24 states have internal predecessors, (88), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 106 [2024-11-10 19:44:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:54,663 INFO L225 Difference]: With dead ends: 173 [2024-11-10 19:44:54,664 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 19:44:54,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=3202, Unknown=0, NotChecked=0, Total=4032 [2024-11-10 19:44:54,665 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 290 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:54,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 399 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:44:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 19:44:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2024-11-10 19:44:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 122 states have (on average 1.098360655737705) internal successors, (134), 123 states have internal predecessors, (134), 36 states have call successors, (36), 13 states have call predecessors, (36), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 19:44:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2024-11-10 19:44:54,678 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 106 [2024-11-10 19:44:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:54,679 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2024-11-10 19:44:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 24 states have internal predecessors, (88), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-10 19:44:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2024-11-10 19:44:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 19:44:54,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:54,682 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:54,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:44:54,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:54,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:54,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1640155359, now seen corresponding path program 3 times [2024-11-10 19:44:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231321243] [2024-11-10 19:44:54,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:44:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:44:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 19:44:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 19:44:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 19:44:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:44:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:44:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 19:44:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 19:44:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 19:44:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 19:44:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 19:44:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 19:44:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 19:44:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 19:44:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 19:44:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 19:44:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 19:44:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 19:44:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 19:44:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-10 19:44:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231321243] [2024-11-10 19:44:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231321243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518637247] [2024-11-10 19:44:55,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:44:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:55,778 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 19:44:55,779 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 19:44:55,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-10 19:44:55,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:44:55,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 19:44:55,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-10 19:44:56,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-10 19:44:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518637247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:56,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2024-11-10 19:44:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823134834] [2024-11-10 19:44:56,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:56,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 19:44:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 19:44:56,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 19:44:56,401 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 32 states have internal predecessors, (125), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-10 19:44:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:58,774 INFO L93 Difference]: Finished difference Result 355 states and 429 transitions. [2024-11-10 19:44:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-11-10 19:44:58,775 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 32 states have internal predecessors, (125), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 214 [2024-11-10 19:44:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:58,780 INFO L225 Difference]: With dead ends: 355 [2024-11-10 19:44:58,780 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 19:44:58,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5030 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3454, Invalid=15452, Unknown=0, NotChecked=0, Total=18906 [2024-11-10 19:44:58,788 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 956 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:58,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 389 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:44:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 19:44:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 290. [2024-11-10 19:44:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.1173708920187793) internal successors, (238), 213 states have internal predecessors, (238), 74 states have call successors, (74), 26 states have call predecessors, (74), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 19:44:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 362 transitions. [2024-11-10 19:44:58,819 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 362 transitions. Word has length 214 [2024-11-10 19:44:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:58,819 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 362 transitions. [2024-11-10 19:44:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 32 states have internal predecessors, (125), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-10 19:44:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2024-11-10 19:44:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-10 19:44:58,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:58,823 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:58,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 19:44:59,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:59,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:59,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1385027135, now seen corresponding path program 1 times [2024-11-10 19:44:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703208983] [2024-11-10 19:44:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:44:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:44:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:44:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:44:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:44:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 19:44:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 19:44:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 19:44:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:44:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:44:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 19:44:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 19:44:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 19:44:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 19:44:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 19:44:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 19:44:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 19:44:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 19:44:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 19:44:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 19:44:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 19:44:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 19:44:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 19:44:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-10 19:44:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 19:44:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-10 19:44:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 19:44:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2024-11-10 19:44:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703208983] [2024-11-10 19:44:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703208983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:44:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973528480] [2024-11-10 19:44:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:44:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:44:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:59,697 INFO L87 Difference]: Start difference. First operand 290 states and 362 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 19:44:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:59,806 INFO L93 Difference]: Finished difference Result 441 states and 544 transitions. [2024-11-10 19:44:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:44:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 250 [2024-11-10 19:44:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:59,812 INFO L225 Difference]: With dead ends: 441 [2024-11-10 19:44:59,812 INFO L226 Difference]: Without dead ends: 277 [2024-11-10 19:44:59,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:44:59,813 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:59,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 149 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-10 19:44:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-10 19:44:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 203 states have (on average 1.1133004926108374) internal successors, (226), 203 states have internal predecessors, (226), 71 states have call successors, (71), 25 states have call predecessors, (71), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 19:44:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2024-11-10 19:44:59,848 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 250 [2024-11-10 19:44:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2024-11-10 19:44:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 19:44:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2024-11-10 19:44:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-10 19:44:59,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:59,854 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 19:44:59,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 181193153, now seen corresponding path program 2 times [2024-11-10 19:44:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82273999] [2024-11-10 19:44:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:45:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:45:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 19:45:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 19:45:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:45:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 19:45:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 19:45:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 19:45:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 19:45:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:45:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:45:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 19:45:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 19:45:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 19:45:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 19:45:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 19:45:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 19:45:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 19:45:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 19:45:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 19:45:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 19:45:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 19:45:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 19:45:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 19:45:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-10 19:45:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 19:45:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-10 19:45:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 19:45:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 175 proven. 5 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2024-11-10 19:45:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:45:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82273999] [2024-11-10 19:45:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82273999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:45:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118806079] [2024-11-10 19:45:00,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:45:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:45:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:45:00,475 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 19:45:00,479 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 19:45:00,613 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:45:00,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:45:00,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 19:45:00,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2024-11-10 19:45:01,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2024-11-10 19:45:02,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118806079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:45:02,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:45:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 37, 37] total 80 [2024-11-10 19:45:02,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553005212] [2024-11-10 19:45:02,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:45:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-10 19:45:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:45:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-10 19:45:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=5334, Unknown=0, NotChecked=0, Total=6320 [2024-11-10 19:45:02,518 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand has 80 states, 80 states have (on average 2.6625) internal successors, (213), 55 states have internal predecessors, (213), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-10 19:45:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:06,567 INFO L93 Difference]: Finished difference Result 419 states and 524 transitions. [2024-11-10 19:45:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-10 19:45:06,568 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.6625) internal successors, (213), 55 states have internal predecessors, (213), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) Word has length 250 [2024-11-10 19:45:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:06,569 INFO L225 Difference]: With dead ends: 419 [2024-11-10 19:45:06,569 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:45:06,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13296 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8181, Invalid=32825, Unknown=0, NotChecked=0, Total=41006 [2024-11-10 19:45:06,575 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 695 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:06,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 256 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:45:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:45:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:45:06,576 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 19:45:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:45:06,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2024-11-10 19:45:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:06,576 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:45:06,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.6625) internal successors, (213), 55 states have internal predecessors, (213), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-10 19:45:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:45:06,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:45:06,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-10 19:45:06,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-10 19:45:06,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-10 19:45:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-10 19:45:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-10 19:45:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-10 19:45:06,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:45:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:45:06,783 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:06,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:45:09,516 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:45:09,534 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:433) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-10 19:45:09,541 INFO L158 Benchmark]: Toolchain (without parser) took 19866.00ms. Allocated memory was 167.8MB in the beginning and 465.6MB in the end (delta: 297.8MB). Free memory was 94.4MB in the beginning and 300.5MB in the end (delta: -206.1MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. [2024-11-10 19:45:09,541 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 119.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:45:09,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.59ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.2MB in the end (delta: -42.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-10 19:45:09,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.35ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 134.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:45:09,541 INFO L158 Benchmark]: Boogie Preprocessor took 66.21ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 134.5MB in the beginning and 193.3MB in the end (delta: -58.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:45:09,541 INFO L158 Benchmark]: IcfgBuilder took 302.31ms. Allocated memory is still 222.3MB. Free memory was 193.3MB in the beginning and 178.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 19:45:09,542 INFO L158 Benchmark]: TraceAbstraction took 19238.43ms. Allocated memory was 222.3MB in the beginning and 465.6MB in the end (delta: 243.3MB). Free memory was 177.6MB in the beginning and 300.5MB in the end (delta: -122.9MB). Peak memory consumption was 220.0MB. Max. memory is 16.1GB. [2024-11-10 19:45:09,542 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.76ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 119.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.59ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.2MB in the end (delta: -42.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.35ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 134.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.21ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 134.5MB in the beginning and 193.3MB in the end (delta: -58.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 302.31ms. Allocated memory is still 222.3MB. Free memory was 193.3MB in the beginning and 178.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19238.43ms. Allocated memory was 222.3MB in the beginning and 465.6MB in the end (delta: 243.3MB). Free memory was 177.6MB in the beginning and 300.5MB in the end (delta: -122.9MB). Peak memory consumption was 220.0MB. 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2225 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2224 mSDsluCounter, 2219 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1884 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1688 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 335 mSDtfsCounter, 1688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1990 GetRequests, 1500 SyntacticMatches, 0 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19758 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=9, InterpolantAutomatonStates: 345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1744 NumberOfCodeBlocks, 1744 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2395 ConstructedInterpolants, 0 QuantifiedInterpolants, 4543 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2406 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 7504/9904 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 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-10 19:45:09,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:45:11,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:45:11,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-10 19:45:11,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:45:11,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:45:11,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:45:11,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:45:11,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:45:11,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:45:11,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:45:11,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:45:11,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:45:11,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:45:11,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:45:11,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:45:11,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:45:11,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:45:11,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:45:11,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:45:11,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 19:45:11,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:45:11,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:45:11,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:45:11,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:45:11,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:45:11,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:45:11,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:45:11,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:45:11,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:45:11,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:45:11,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 19:45:11,540 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 19:45:11,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:45:11,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:45:11,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:45:11,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:45:11,540 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-10 19:45:11,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:45:11,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:45:11,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:45:11,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:45:11,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:45:11,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 19:45:13,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:45:13,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:45:13,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 19:45:13,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d65d2644/7501256d84fa4f939a64f7b6b0aa5206/FLAG2575e0fa2 [2024-11-10 19:45:13,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d65d2644/7501256d84fa4f939a64f7b6b0aa5206 [2024-11-10 19:45:13,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:45:13,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:45:13,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:45:13,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:45:13,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:45:13,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d92a3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13, skipping insertion in model container [2024-11-10 19:45:13,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:45:13,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:45:13,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:45:13,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:45:13,733 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:45:13,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13 WrapperNode [2024-11-10 19:45:13,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:45:13,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:45:13,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:45:13,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:45:13,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,764 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2024-11-10 19:45:13,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:45:13,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:45:13,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:45:13,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:45:13,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,793 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 19:45:13,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:45:13,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:45:13,813 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:45:13,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:45:13,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (1/1) ... [2024-11-10 19:45:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:45:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:45:13,843 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 19:45:13,848 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 19:45:13,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:45:13,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 19:45:13,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 19:45:13,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:45:13,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-10 19:45:13,881 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:45:13,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:45:13,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:45:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:45:13,947 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:45:13,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:45:14,127 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 19:45:14,127 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:45:14,139 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:45:14,139 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:45:14,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:45:14 BoogieIcfgContainer [2024-11-10 19:45:14,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:45:14,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:45:14,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:45:14,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:45:14,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:45:13" (1/3) ... [2024-11-10 19:45:14,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba97367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:45:14, skipping insertion in model container [2024-11-10 19:45:14,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:13" (2/3) ... [2024-11-10 19:45:14,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba97367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:45:14, skipping insertion in model container [2024-11-10 19:45:14,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:45:14" (3/3) ... [2024-11-10 19:45:14,146 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-10 19:45:14,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:45:14,157 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 19:45:14,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:45:14,208 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;@50c85071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:45:14,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 19:45:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:45:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:45:14,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:14,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:14,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1863574553, now seen corresponding path program 1 times [2024-11-10 19:45:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099000996] [2024-11-10 19:45:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:14,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:14,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:14,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:14,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 19:45:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:14,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 19:45:14,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 19:45:14,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:14,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099000996] [2024-11-10 19:45:14,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099000996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:14,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:45:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263111553] [2024-11-10 19:45:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:45:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:45:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:45:14,365 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:45:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:14,384 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2024-11-10 19:45:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:45:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-10 19:45:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:14,390 INFO L225 Difference]: With dead ends: 91 [2024-11-10 19:45:14,391 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 19:45:14,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 19:45:14,397 INFO L432 NwaCegarLoop]: 51 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, 51 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 19:45:14,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 19:45:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 19:45:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:45:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-10 19:45:14,427 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2024-11-10 19:45:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:14,427 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-10 19:45:14,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:45:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-10 19:45:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:45:14,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:14,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:14,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 19:45:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:14,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1705862683, now seen corresponding path program 1 times [2024-11-10 19:45:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552340499] [2024-11-10 19:45:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:14,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:14,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:14,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 19:45:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:14,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:45:14,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:45:14,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:45:14,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552340499] [2024-11-10 19:45:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552340499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:45:14,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:45:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 19:45:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943892468] [2024-11-10 19:45:14,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:45:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:45:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:45:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:45:14,858 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:45:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:14,903 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-10 19:45:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:45:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2024-11-10 19:45:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:14,904 INFO L225 Difference]: With dead ends: 34 [2024-11-10 19:45:14,904 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 19:45:14,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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 19:45:14,905 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:14,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 19:45:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 19:45:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:45:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-10 19:45:14,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 16 [2024-11-10 19:45:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-10 19:45:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:45:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-10 19:45:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 19:45:14,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:14,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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 19:45:14,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:45:15,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1837964732, now seen corresponding path program 1 times [2024-11-10 19:45:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:15,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001986992] [2024-11-10 19:45:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:15,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 19:45:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:15,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:45:15,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:45:15,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:15,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:15,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001986992] [2024-11-10 19:45:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001986992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:15,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:15,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:45:15,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239800795] [2024-11-10 19:45:15,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:15,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:45:15,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:45:15,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:45:15,211 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:15,285 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-10 19:45:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:45:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-10 19:45:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:15,286 INFO L225 Difference]: With dead ends: 49 [2024-11-10 19:45:15,286 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 19:45:15,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:45:15,287 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:15,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 19:45:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-11-10 19:45:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:45:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-10 19:45:15,293 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 33 [2024-11-10 19:45:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:15,293 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-10 19:45:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-10 19:45:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:45:15,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:15,294 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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 19:45:15,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 19:45:15,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:15,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1142325889, now seen corresponding path program 1 times [2024-11-10 19:45:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569702484] [2024-11-10 19:45:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:15,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:15,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:15,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 19:45:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:15,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:45:15,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:45:15,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:15,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569702484] [2024-11-10 19:45:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569702484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:15,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:45:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126819300] [2024-11-10 19:45:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:15,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:45:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:45:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:45:15,567 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:15,610 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-10 19:45:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:45:15,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-10 19:45:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:15,611 INFO L225 Difference]: With dead ends: 48 [2024-11-10 19:45:15,611 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 19:45:15,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:45:15,612 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 117 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 19:45:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-10 19:45:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:45:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-10 19:45:15,618 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 34 [2024-11-10 19:45:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-10 19:45:15,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-10 19:45:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 19:45:15,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:15,620 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:15,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 19:45:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2043692972, now seen corresponding path program 1 times [2024-11-10 19:45:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:15,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886542907] [2024-11-10 19:45:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:15,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:15,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:15,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:15,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 19:45:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:15,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:45:15,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 19:45:15,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 19:45:16,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886542907] [2024-11-10 19:45:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886542907] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 19:45:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:45:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 19:45:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245297617] [2024-11-10 19:45:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:45:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:45:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:45:16,097 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:16,183 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-10 19:45:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:45:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-10 19:45:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:16,185 INFO L225 Difference]: With dead ends: 61 [2024-11-10 19:45:16,185 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 19:45:16,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:45:16,186 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:16,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 19:45:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2024-11-10 19:45:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:45:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-10 19:45:16,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 51 [2024-11-10 19:45:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:16,194 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-10 19:45:16,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:45:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-10 19:45:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 19:45:16,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:16,196 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:16,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 19:45:16,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:16,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1070033263, now seen corresponding path program 1 times [2024-11-10 19:45:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431174580] [2024-11-10 19:45:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:16,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:16,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:16,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:16,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 19:45:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:16,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:45:16,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:45:16,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:45:16,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431174580] [2024-11-10 19:45:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431174580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:45:16,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:45:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-10 19:45:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932275391] [2024-11-10 19:45:16,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:45:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:45:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:16,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:45:16,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:45:16,696 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:45:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:17,092 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2024-11-10 19:45:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 19:45:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 52 [2024-11-10 19:45:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:17,093 INFO L225 Difference]: With dead ends: 89 [2024-11-10 19:45:17,093 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:45:17,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-11-10 19:45:17,095 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 140 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:17,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 222 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:45:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:45:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:45:17,096 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 19:45:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:45:17,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-10 19:45:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:45:17,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:45:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:45:17,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:45:17,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-10 19:45:17,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-10 19:45:17,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-10 19:45:17,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-10 19:45:17,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-10 19:45:17,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-10 19:45:17,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 19:45:17,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:17,305 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 19:45:17,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:45:17,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:45:17,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:45:17 BoogieIcfgContainer [2024-11-10 19:45:17,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:45:17,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:45:17,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:45:17,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:45:17,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:45:14" (3/4) ... [2024-11-10 19:45:17,574 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:45:17,577 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:45:17,577 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2024-11-10 19:45:17,577 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:45:17,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-10 19:45:17,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 19:45:17,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:45:17,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:45:17,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:45:17,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:45:17,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:45:17,651 INFO L158 Benchmark]: Toolchain (without parser) took 4196.52ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 48.1MB in the beginning and 78.7MB in the end (delta: -30.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,652 INFO L158 Benchmark]: CDTParser took 3.52ms. Allocated memory is still 86.0MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:45:17,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.46ms. Allocated memory is still 86.0MB. Free memory was 47.8MB in the beginning and 62.4MB in the end (delta: -14.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.74ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 60.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,652 INFO L158 Benchmark]: Boogie Preprocessor took 45.63ms. Allocated memory is still 86.0MB. Free memory was 60.6MB in the beginning and 58.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,653 INFO L158 Benchmark]: IcfgBuilder took 326.96ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 42.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,653 INFO L158 Benchmark]: TraceAbstraction took 3429.89ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.5MB in the beginning and 83.9MB in the end (delta: -41.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,653 INFO L158 Benchmark]: Witness Printer took 79.53ms. Allocated memory is still 125.8MB. Free memory was 83.9MB in the beginning and 78.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 19:45:17,654 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.52ms. Allocated memory is still 86.0MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.46ms. Allocated memory is still 86.0MB. Free memory was 47.8MB in the beginning and 62.4MB in the end (delta: -14.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.74ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 60.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.63ms. Allocated memory is still 86.0MB. Free memory was 60.6MB in the beginning and 58.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 326.96ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 42.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3429.89ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.5MB in the beginning and 83.9MB in the end (delta: -41.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 79.53ms. Allocated memory is still 125.8MB. Free memory was 83.9MB in the beginning and 78.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 823 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 607 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 216 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 10 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 152/176 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 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:45:17,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE