./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i --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/nla-digbench-scaling/divbin_unwindbound20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:05:01,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:05:01,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:05:01,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:05:01,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:05:01,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:05:01,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:05:01,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:05:01,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:05:01,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:05:01,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:05:01,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:05:01,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:05:01,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:05:01,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:05:01,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:05:01,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:05:01,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:05:01,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:05:01,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:05:01,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:05:01,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:05:01,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:05:01,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:05:01,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:05:01,128 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:05:01,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:05:01,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:05:01,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:05:01,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:05:01,130 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:05:01,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:05:01,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:05:01,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:05:01,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:05:01,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:05:01,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:05:01,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:05:01,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:05:01,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:05:01,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:05:01,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:05:01,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:05:01,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:05:01,135 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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2024-11-10 19:05:01,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:05:01,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:05:01,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:05:01,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:05:01,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:05:01,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-11-10 19:05:02,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:05:03,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:05:03,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-11-10 19:05:03,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162a2db3e/4d151e29a4c7497db7350e60f08b62b9/FLAGdb0d88e64 [2024-11-10 19:05:03,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162a2db3e/4d151e29a4c7497db7350e60f08b62b9 [2024-11-10 19:05:03,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:05:03,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:05:03,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:05:03,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:05:03,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:05:03,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc109e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03, skipping insertion in model container [2024-11-10 19:05:03,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:05:03,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:05:03,673 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:05:03,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:05:03,723 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:05:03,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03 WrapperNode [2024-11-10 19:05:03,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:05:03,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:05:03,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:05:03,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:05:03,731 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:05:03" (1/1) ... [2024-11-10 19:05:03,746 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:05:03" (1/1) ... [2024-11-10 19:05:03,761 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-11-10 19:05:03,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:05:03,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:05:03,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:05:03,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:05:03,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:05:03,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:05:03,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:05:03,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:05:03,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:05:03,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (1/1) ... [2024-11-10 19:05:03,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:05:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:03,837 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:05:03,841 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:05:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:05:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:05:03,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:05:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:05:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:05:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:05:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:05:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:05:03,956 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:05:03,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:05:04,138 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 19:05:04,138 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:05:04,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:05:04,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:05:04,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:04 BoogieIcfgContainer [2024-11-10 19:05:04,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:05:04,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:05:04,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:05:04,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:05:04,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:05:03" (1/3) ... [2024-11-10 19:05:04,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3f034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:04, skipping insertion in model container [2024-11-10 19:05:04,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:03" (2/3) ... [2024-11-10 19:05:04,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3f034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:04, skipping insertion in model container [2024-11-10 19:05:04,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:04" (3/3) ... [2024-11-10 19:05:04,169 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2024-11-10 19:05:04,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:05:04,184 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 19:05:04,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:05:04,242 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;@1366ee4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:05:04,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 19:05:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:05:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:05:04,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:04,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:04,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1639212164, now seen corresponding path program 1 times [2024-11-10 19:05:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872267317] [2024-11-10 19:05:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,447 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:05:04,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872267317] [2024-11-10 19:05:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872267317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:05:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:05:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782092758] [2024-11-10 19:05:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:05:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:05:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:05:04,488 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:05:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:04,510 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-11-10 19:05:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:05:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 15 [2024-11-10 19:05:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:04,518 INFO L225 Difference]: With dead ends: 74 [2024-11-10 19:05:04,518 INFO L226 Difference]: Without dead ends: 31 [2024-11-10 19:05:04,522 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:05:04,526 INFO L432 NwaCegarLoop]: 44 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, 44 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:05:04,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-10 19:05:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-10 19:05:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-10 19:05:04,566 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2024-11-10 19:05:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-10 19:05:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:05:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-10 19:05:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:05:04,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:04,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:04,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:05:04,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:04,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -129110044, now seen corresponding path program 1 times [2024-11-10 19:05:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524522463] [2024-11-10 19:05:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,727 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:05:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524522463] [2024-11-10 19:05:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524522463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:05:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:05:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994625175] [2024-11-10 19:05:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:05:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:05:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:05:04,736 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:04,792 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-10 19:05:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:05:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-10 19:05:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:04,793 INFO L225 Difference]: With dead ends: 37 [2024-11-10 19:05:04,794 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 19:05:04,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:05:04,795 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:04,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 19:05:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-11-10 19:05:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-10 19:05:04,805 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2024-11-10 19:05:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:04,806 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-10 19:05:04,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-10 19:05:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:05:04,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:04,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:04,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:05:04,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:04,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash 292555929, now seen corresponding path program 1 times [2024-11-10 19:05:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727643950] [2024-11-10 19:05:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:04,989 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:05:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727643950] [2024-11-10 19:05:04,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727643950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:05:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:05:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201449509] [2024-11-10 19:05:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:05:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:05:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:05:04,996 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:05,046 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-10 19:05:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:05:05,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-10 19:05:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:05,049 INFO L225 Difference]: With dead ends: 50 [2024-11-10 19:05:05,049 INFO L226 Difference]: Without dead ends: 35 [2024-11-10 19:05:05,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:05:05,050 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:05,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-10 19:05:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-10 19:05:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-10 19:05:05,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 16 [2024-11-10 19:05:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:05,062 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-10 19:05:05,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-10 19:05:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 19:05:05,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:05,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:05,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:05:05,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -745397283, now seen corresponding path program 1 times [2024-11-10 19:05:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633796663] [2024-11-10 19:05:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,217 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:05:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633796663] [2024-11-10 19:05:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633796663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:05:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:05:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104120562] [2024-11-10 19:05:05,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:05:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:05,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:05:05,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:05:05,219 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:05,327 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-10 19:05:05,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:05:05,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-10 19:05:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:05,329 INFO L225 Difference]: With dead ends: 35 [2024-11-10 19:05:05,329 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 19:05:05,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:05:05,331 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:05,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:05:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 19:05:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 19:05:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-10 19:05:05,339 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2024-11-10 19:05:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:05,340 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-10 19:05:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-10 19:05:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:05:05,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:05,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:05:05,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1632479309, now seen corresponding path program 1 times [2024-11-10 19:05:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807408620] [2024-11-10 19:05:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:05,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,433 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:05:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807408620] [2024-11-10 19:05:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807408620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:05:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:05:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796392] [2024-11-10 19:05:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:05:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:05:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:05:05,437 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:05,515 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-11-10 19:05:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:05:05,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-10 19:05:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:05,517 INFO L225 Difference]: With dead ends: 46 [2024-11-10 19:05:05,517 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 19:05:05,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:05:05,518 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:05,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 97 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 19:05:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-10 19:05:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-10 19:05:05,524 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-11-10 19:05:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:05,525 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-10 19:05:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-10 19:05:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:05:05,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:05,526 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:05:05,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:05,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1632406818, now seen corresponding path program 1 times [2024-11-10 19:05:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216415708] [2024-11-10 19:05:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216415708] [2024-11-10 19:05:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216415708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780350823] [2024-11-10 19:05:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:05,639 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:05:05,640 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:05:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:05,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:05:05,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:05,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:05:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780350823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:05:05,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:05:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-10 19:05:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630547230] [2024-11-10 19:05:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:05:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:05:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:05:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:05:05,773 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:05,839 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-10 19:05:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:05:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-10 19:05:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:05,840 INFO L225 Difference]: With dead ends: 43 [2024-11-10 19:05:05,841 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 19:05:05,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:05:05,842 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:05,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 19:05:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-11-10 19:05:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-10 19:05:05,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2024-11-10 19:05:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:05,855 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-10 19:05:05,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:05:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-10 19:05:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 19:05:05,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:05,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:05,874 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:05:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 19:05:06,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1673764650, now seen corresponding path program 1 times [2024-11-10 19:05:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526618735] [2024-11-10 19:05:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526618735] [2024-11-10 19:05:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526618735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972818069] [2024-11-10 19:05:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:06,161 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:05:06,162 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:05:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:05:06,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972818069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:06,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-10 19:05:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622546338] [2024-11-10 19:05:06,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 19:05:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 19:05:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:05:06,315 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:05:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:06,424 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-10 19:05:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 19:05:06,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2024-11-10 19:05:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:06,426 INFO L225 Difference]: With dead ends: 78 [2024-11-10 19:05:06,426 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 19:05:06,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:05:06,427 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:06,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 174 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:05:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 19:05:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2024-11-10 19:05:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:05:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-10 19:05:06,434 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 27 [2024-11-10 19:05:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:06,434 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-10 19:05:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:05:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-10 19:05:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 19:05:06,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:06,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:06,453 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:05:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 19:05:06,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -346081736, now seen corresponding path program 1 times [2024-11-10 19:05:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721857280] [2024-11-10 19:05:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721857280] [2024-11-10 19:05:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721857280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921733623] [2024-11-10 19:05:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:06,737 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:05:06,740 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:05:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:06,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:05:06,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921733623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:06,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-10 19:05:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728077034] [2024-11-10 19:05:06,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:06,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 19:05:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 19:05:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-10 19:05:06,987 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:05:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:07,295 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-10 19:05:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 19:05:07,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-11-10 19:05:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:07,296 INFO L225 Difference]: With dead ends: 88 [2024-11-10 19:05:07,297 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 19:05:07,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-10 19:05:07,298 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 152 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:07,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:05:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 19:05:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-11-10 19:05:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:05:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-10 19:05:07,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 28 [2024-11-10 19:05:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:07,311 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-10 19:05:07,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:05:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-10 19:05:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 19:05:07,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:07,314 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:07,331 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:05:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:07,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 566896391, now seen corresponding path program 1 times [2024-11-10 19:05:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443572459] [2024-11-10 19:05:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:05:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 19:05:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 19:05:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 19:05:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443572459] [2024-11-10 19:05:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443572459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318450093] [2024-11-10 19:05:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:07,753 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:05:07,755 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:05:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:07,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 19:05:07,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:08,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 19:05:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318450093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:08,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-10 19:05:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870530536] [2024-11-10 19:05:08,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 19:05:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 19:05:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-10 19:05:08,241 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 19:05:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:08,877 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2024-11-10 19:05:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 19:05:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 58 [2024-11-10 19:05:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:08,880 INFO L225 Difference]: With dead ends: 245 [2024-11-10 19:05:08,880 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 19:05:08,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 19:05:08,882 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 210 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:08,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:05:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 19:05:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 186. [2024-11-10 19:05:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 158 states have (on average 1.1139240506329113) internal successors, (176), 158 states have internal predecessors, (176), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 19:05:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2024-11-10 19:05:08,901 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 58 [2024-11-10 19:05:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2024-11-10 19:05:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 19:05:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2024-11-10 19:05:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 19:05:08,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:08,904 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:08,921 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:05:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:09,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 369847839, now seen corresponding path program 1 times [2024-11-10 19:05:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529980478] [2024-11-10 19:05:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 19:05:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:05:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529980478] [2024-11-10 19:05:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529980478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498693741] [2024-11-10 19:05:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:09,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:09,298 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:05:09,300 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:05:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:09,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 19:05:09,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:09,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498693741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:09,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-10 19:05:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525708702] [2024-11-10 19:05:09,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 19:05:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 19:05:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:05:09,585 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:05:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:09,954 INFO L93 Difference]: Finished difference Result 282 states and 314 transitions. [2024-11-10 19:05:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 19:05:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2024-11-10 19:05:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:09,957 INFO L225 Difference]: With dead ends: 282 [2024-11-10 19:05:09,957 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 19:05:09,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 19:05:09,959 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 182 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:09,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 201 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:05:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 19:05:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 222. [2024-11-10 19:05:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 194 states have internal predecessors, (218), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 19:05:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2024-11-10 19:05:09,986 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 69 [2024-11-10 19:05:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:09,986 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2024-11-10 19:05:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:05:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2024-11-10 19:05:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 19:05:09,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:09,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:10,010 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:05:10,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 19:05:10,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:10,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash 670161793, now seen corresponding path program 2 times [2024-11-10 19:05:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392774220] [2024-11-10 19:05:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 19:05:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 19:05:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392774220] [2024-11-10 19:05:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392774220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582405640] [2024-11-10 19:05:10,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:05:10,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:10,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:10,753 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:05:10,755 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:05:10,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:05:10,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:05:10,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 19:05:10,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:10,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 19:05:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582405640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:11,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 42 [2024-11-10 19:05:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304259388] [2024-11-10 19:05:11,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 19:05:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 19:05:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 19:05:11,496 INFO L87 Difference]: Start difference. First operand 222 states and 246 transitions. Second operand has 42 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:05:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:12,505 INFO L93 Difference]: Finished difference Result 382 states and 428 transitions. [2024-11-10 19:05:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-10 19:05:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2024-11-10 19:05:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:12,507 INFO L225 Difference]: With dead ends: 382 [2024-11-10 19:05:12,507 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 19:05:12,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 195 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2099, Invalid=4381, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 19:05:12,510 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 361 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:12,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 324 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:05:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 19:05:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 282. [2024-11-10 19:05:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 254 states have (on average 1.1338582677165354) internal successors, (288), 254 states have internal predecessors, (288), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 19:05:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 316 transitions. [2024-11-10 19:05:12,525 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 316 transitions. Word has length 105 [2024-11-10 19:05:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 316 transitions. [2024-11-10 19:05:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:05:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2024-11-10 19:05:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 19:05:12,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:12,528 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:12,545 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:05:12,728 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:05:12,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -403989736, now seen corresponding path program 1 times [2024-11-10 19:05:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572533062] [2024-11-10 19:05:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 19:05:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 19:05:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 19:05:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 19:05:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 19:05:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 19:05:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 19:05:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 19:05:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 19:05:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572533062] [2024-11-10 19:05:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572533062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629688377] [2024-11-10 19:05:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:13,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:13,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:05:13,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:05:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:13,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 19:05:13,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 362 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:14,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 250 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 19:05:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629688377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:14,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2024-11-10 19:05:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070263500] [2024-11-10 19:05:14,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-10 19:05:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-10 19:05:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2024-11-10 19:05:14,860 INFO L87 Difference]: Start difference. First operand 282 states and 316 transitions. Second operand has 66 states, 65 states have (on average 3.7846153846153845) internal successors, (246), 66 states have internal predecessors, (246), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-10 19:05:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:16,693 INFO L93 Difference]: Finished difference Result 701 states and 787 transitions. [2024-11-10 19:05:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-10 19:05:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.7846153846153845) internal successors, (246), 66 states have internal predecessors, (246), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 124 [2024-11-10 19:05:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:16,699 INFO L225 Difference]: With dead ends: 701 [2024-11-10 19:05:16,699 INFO L226 Difference]: Without dead ends: 700 [2024-11-10 19:05:16,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3643 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-11-10 19:05:16,704 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 577 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:16,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 394 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:05:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-10 19:05:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 462. [2024-11-10 19:05:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 404 states have (on average 1.1212871287128714) internal successors, (453), 404 states have internal predecessors, (453), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 19:05:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 511 transitions. [2024-11-10 19:05:16,731 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 511 transitions. Word has length 124 [2024-11-10 19:05:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:16,731 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 511 transitions. [2024-11-10 19:05:16,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.7846153846153845) internal successors, (246), 66 states have internal predecessors, (246), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-10 19:05:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 511 transitions. [2024-11-10 19:05:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-10 19:05:16,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:16,738 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:16,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 19:05:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:16,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1025443061, now seen corresponding path program 2 times [2024-11-10 19:05:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657451718] [2024-11-10 19:05:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 19:05:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 19:05:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 19:05:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 19:05:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 19:05:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 19:05:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 19:05:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 19:05:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 19:05:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 19:05:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 19:05:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 19:05:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 19:05:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-10 19:05:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-10 19:05:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 19:05:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 19:05:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 19:05:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 1279 proven. 17 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-10 19:05:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657451718] [2024-11-10 19:05:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657451718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719811159] [2024-11-10 19:05:18,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:05:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:18,772 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:18,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:05:18,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:05:18,895 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:05:18,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 19:05:18,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 1891 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:05:19,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 1279 proven. 17 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-10 19:05:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719811159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:19,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 44] total 44 [2024-11-10 19:05:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805905134] [2024-11-10 19:05:19,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 19:05:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 19:05:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 19:05:20,002 INFO L87 Difference]: Start difference. First operand 462 states and 511 transitions. Second operand has 44 states, 44 states have (on average 4.840909090909091) internal successors, (213), 44 states have internal predecessors, (213), 19 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 19 states have call predecessors, (40), 19 states have call successors, (40) [2024-11-10 19:05:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:20,951 INFO L93 Difference]: Finished difference Result 688 states and 755 transitions. [2024-11-10 19:05:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-10 19:05:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.840909090909091) internal successors, (213), 44 states have internal predecessors, (213), 19 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 19 states have call predecessors, (40), 19 states have call successors, (40) Word has length 250 [2024-11-10 19:05:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:20,954 INFO L225 Difference]: With dead ends: 688 [2024-11-10 19:05:20,954 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 19:05:20,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 498 SyntacticMatches, 41 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1940, Invalid=5200, Unknown=0, NotChecked=0, Total=7140 [2024-11-10 19:05:20,957 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 118 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:20,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1507 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 19:05:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 19:05:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2024-11-10 19:05:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 291 states have (on average 1.0996563573883162) internal successors, (320), 291 states have internal predecessors, (320), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 19:05:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 378 transitions. [2024-11-10 19:05:20,975 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 378 transitions. Word has length 250 [2024-11-10 19:05:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 378 transitions. [2024-11-10 19:05:20,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.840909090909091) internal successors, (213), 44 states have internal predecessors, (213), 19 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 19 states have call predecessors, (40), 19 states have call successors, (40) [2024-11-10 19:05:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 378 transitions. [2024-11-10 19:05:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-10 19:05:20,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:05:20,980 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:20,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 19:05:21,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-10 19:05:21,185 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:05:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:05:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1212217767, now seen corresponding path program 2 times [2024-11-10 19:05:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:05:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655018958] [2024-11-10 19:05:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:05:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:05:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:05:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:05:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:05:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 19:05:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 19:05:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 19:05:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 19:05:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 19:05:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 19:05:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 19:05:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 19:05:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 19:05:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 19:05:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 19:05:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 19:05:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 19:05:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-10 19:05:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-10 19:05:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 19:05:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 19:05:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 19:05:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 19:05:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-10 19:05:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-10 19:05:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-11-10 19:05:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-10 19:05:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-10 19:05:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-10 19:05:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-11-10 19:05:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:05:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4297 backedges. 382 proven. 7 refuted. 0 times theorem prover too weak. 3908 trivial. 0 not checked. [2024-11-10 19:05:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:05:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655018958] [2024-11-10 19:05:21,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655018958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:05:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992226252] [2024-11-10 19:05:21,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:05:21,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:05:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:05:21,588 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:21,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:05:21,743 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:05:21,744 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:05:21,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 19:05:21,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:05:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4297 backedges. 3952 proven. 19 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-10 19:05:22,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:05:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4297 backedges. 2660 proven. 19 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2024-11-10 19:05:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992226252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:05:23,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:05:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 43, 44] total 49 [2024-11-10 19:05:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244083068] [2024-11-10 19:05:23,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:05:23,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 19:05:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:05:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 19:05:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1855, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 19:05:23,799 INFO L87 Difference]: Start difference. First operand 349 states and 378 transitions. Second operand has 49 states, 49 states have (on average 5.183673469387755) internal successors, (254), 49 states have internal predecessors, (254), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-11-10 19:05:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:05:25,196 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2024-11-10 19:05:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-10 19:05:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.183673469387755) internal successors, (254), 49 states have internal predecessors, (254), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) Word has length 346 [2024-11-10 19:05:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:05:25,198 INFO L225 Difference]: With dead ends: 349 [2024-11-10 19:05:25,198 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:05:25,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 685 SyntacticMatches, 41 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2960, Invalid=9250, Unknown=0, NotChecked=0, Total=12210 [2024-11-10 19:05:25,202 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 150 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:05:25,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1200 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:05:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:05:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:05:25,203 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:05:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:05:25,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 346 [2024-11-10 19:05:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:05:25,203 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:05:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.183673469387755) internal successors, (254), 49 states have internal predecessors, (254), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-11-10 19:05:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:05:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:05:25,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 19:05:25,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 19:05:25,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 19:05:25,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 19:05:25,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 19:05:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 19:05:25,411 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:05:25,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:05:28,623 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:05:28,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:05:28 BoogieIcfgContainer [2024-11-10 19:05:28,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:05:28,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:05:28,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:05:28,640 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:05:28,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:04" (3/4) ... [2024-11-10 19:05:28,643 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:05:28,646 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:05:28,646 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:05:28,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-10 19:05:28,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:05:28,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:05:28,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:05:28,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:05:28,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:05:28,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:05:28,784 INFO L158 Benchmark]: Toolchain (without parser) took 25336.15ms. Allocated memory was 155.2MB in the beginning and 358.6MB in the end (delta: 203.4MB). Free memory was 82.7MB in the beginning and 139.3MB in the end (delta: -56.6MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,784 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:05:28,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.29ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 124.7MB in the end (delta: -42.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 124.6MB in the beginning and 177.4MB in the end (delta: -52.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,785 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 205.5MB. Free memory was 177.4MB in the beginning and 175.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,786 INFO L158 Benchmark]: IcfgBuilder took 356.91ms. Allocated memory is still 205.5MB. Free memory was 175.3MB in the beginning and 162.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,787 INFO L158 Benchmark]: TraceAbstraction took 24480.47ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 161.7MB in the beginning and 147.7MB in the end (delta: 14.0MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,787 INFO L158 Benchmark]: Witness Printer took 143.45ms. Allocated memory is still 358.6MB. Free memory was 147.7MB in the beginning and 139.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 19:05:28,788 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.95ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.29ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 124.7MB in the end (delta: -42.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 124.6MB in the beginning and 177.4MB in the end (delta: -52.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 205.5MB. Free memory was 177.4MB in the beginning and 175.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 356.91ms. Allocated memory is still 205.5MB. Free memory was 175.3MB in the beginning and 162.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24480.47ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 161.7MB in the beginning and 147.7MB in the end (delta: 14.0MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. * Witness Printer took 143.45ms. Allocated memory is still 358.6MB. Free memory was 147.7MB in the beginning and 139.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 14, TraceHistogramMax: 28, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1904 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1904 mSDsluCounter, 4602 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3961 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3463 IncrementalHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 641 mSDtfsCounter, 3463 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2641 GetRequests, 1990 SyntacticMatches, 86 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12570 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=12, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 442 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 2147 NumberOfCodeBlocks, 2147 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3123 ConstructedInterpolants, 0 QuantifiedInterpolants, 6829 SizeOfPredicates, 145 NumberOfNonLiveVariables, 2253 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 19006/21235 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 4 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: null - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) || ((20 <= counter) && (counter <= 2147483646))) || ((counter <= 22) && (4 <= counter))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:05:28,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE