./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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/ps6-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:52:01,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:52:01,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:52:01,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:52:01,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:52:01,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:52:01,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:52:01,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:52:01,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:52:01,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:52:01,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:52:01,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:52:01,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:52:01,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:52:01,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:52:01,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:52:01,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:52:01,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:52:01,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:52:01,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:52:01,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:52:01,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:52:01,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:52:01,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:52:01,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:52:01,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:52:01,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:52:01,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:52:01,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:52:01,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:52:01,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:52:01,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:52:01,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:52:01,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:52:01,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:52:01,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:52:01,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:52:01,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:52:01,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:52:01,448 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 -> 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c [2024-11-17 04:52:01,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:52:01,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:52:01,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:52:01,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:52:01,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:52:01,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c [2024-11-17 04:52:03,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:52:03,218 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:52:03,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c [2024-11-17 04:52:03,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb724128/5429d8416a3a482487230843ef7f272e/FLAG3155432bd [2024-11-17 04:52:03,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb724128/5429d8416a3a482487230843ef7f272e [2024-11-17 04:52:03,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:52:03,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:52:03,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:52:03,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:52:03,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:52:03,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:03,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1326dd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03, skipping insertion in model container [2024-11-17 04:52:03,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:03,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:52:03,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:52:03,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:52:03,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:52:03,962 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:52:03,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03 WrapperNode [2024-11-17 04:52:03,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:52:03,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:52:03,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:52:03,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:52:03,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:03,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,019 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2024-11-17 04:52:04,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:52:04,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:52:04,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:52:04,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:52:04,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,063 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-17 04:52:04,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:52:04,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:52:04,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:52:04,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:52:04,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (1/1) ... [2024-11-17 04:52:04,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:52:04,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:04,121 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-17 04:52:04,125 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-17 04:52:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:52:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:52:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:52:04,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:52:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 04:52:04,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 04:52:04,223 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:52:04,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:52:04,737 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-17 04:52:04,737 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:52:04,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:52:04,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:52:04,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:52:04 BoogieIcfgContainer [2024-11-17 04:52:04,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:52:04,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:52:04,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:52:04,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:52:04,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:52:03" (1/3) ... [2024-11-17 04:52:04,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:52:04, skipping insertion in model container [2024-11-17 04:52:04,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:52:03" (2/3) ... [2024-11-17 04:52:04,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:52:04, skipping insertion in model container [2024-11-17 04:52:04,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:52:04" (3/3) ... [2024-11-17 04:52:04,780 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound1.c [2024-11-17 04:52:04,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:52:04,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-11-17 04:52:04,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:52:04,882 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;@6daf9d81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:52:04,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-17 04:52:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 123 states have (on average 1.886178861788618) internal successors, (232), 227 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:52:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 04:52:04,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:04,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 04:52:04,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:04,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -958419874, now seen corresponding path program 1 times [2024-11-17 04:52:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91393270] [2024-11-17 04:52:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91393270] [2024-11-17 04:52:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91393270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:52:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338696789] [2024-11-17 04:52:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:05,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 04:52:05,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 04:52:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:52:05,074 INFO L87 Difference]: Start difference. First operand has 232 states, 123 states have (on average 1.886178861788618) internal successors, (232), 227 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 04:52:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:05,118 INFO L93 Difference]: Finished difference Result 435 states and 474 transitions. [2024-11-17 04:52:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 04:52:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 04:52:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:05,130 INFO L225 Difference]: With dead ends: 435 [2024-11-17 04:52:05,130 INFO L226 Difference]: Without dead ends: 200 [2024-11-17 04:52:05,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:52:05,139 INFO L432 NwaCegarLoop]: 209 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, 209 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-17 04:52:05,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:52:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-17 04:52:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-17 04:52:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 118 states have (on average 1.6779661016949152) internal successors, (198), 196 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2024-11-17 04:52:05,207 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 6 [2024-11-17 04:52:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:05,207 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2024-11-17 04:52:05,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 04:52:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2024-11-17 04:52:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 04:52:05,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:05,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 04:52:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:52:05,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -958390083, now seen corresponding path program 1 times [2024-11-17 04:52:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441760181] [2024-11-17 04:52:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441760181] [2024-11-17 04:52:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441760181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:52:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673666950] [2024-11-17 04:52:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:05,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:05,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:05,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:05,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:05,319 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 04:52:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:05,398 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2024-11-17 04:52:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:52:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 04:52:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:05,401 INFO L225 Difference]: With dead ends: 292 [2024-11-17 04:52:05,401 INFO L226 Difference]: Without dead ends: 205 [2024-11-17 04:52:05,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:52:05,403 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:05,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 585 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:52:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-17 04:52:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-17 04:52:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 123 states have (on average 1.6504065040650406) internal successors, (203), 201 states have internal predecessors, (203), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2024-11-17 04:52:05,423 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 6 [2024-11-17 04:52:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:05,424 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2024-11-17 04:52:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 04:52:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2024-11-17 04:52:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 04:52:05,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:05,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:52:05,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:05,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 613401913, now seen corresponding path program 1 times [2024-11-17 04:52:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086291272] [2024-11-17 04:52:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086291272] [2024-11-17 04:52:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086291272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:05,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:05,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:52:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158539477] [2024-11-17 04:52:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:05,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:52:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:05,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:52:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:05,496 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 04:52:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:05,888 INFO L93 Difference]: Finished difference Result 367 states and 375 transitions. [2024-11-17 04:52:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:52:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 04:52:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:05,890 INFO L225 Difference]: With dead ends: 367 [2024-11-17 04:52:05,891 INFO L226 Difference]: Without dead ends: 303 [2024-11-17 04:52:05,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:05,892 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:05,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 148 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 04:52:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-17 04:52:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-11-17 04:52:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 213 states have (on average 1.4225352112676057) internal successors, (303), 291 states have internal predecessors, (303), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:52:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2024-11-17 04:52:05,920 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 10 [2024-11-17 04:52:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:05,920 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2024-11-17 04:52:05,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 04:52:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2024-11-17 04:52:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 04:52:05,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:05,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:05,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:52:05,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 685748275, now seen corresponding path program 1 times [2024-11-17 04:52:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941210677] [2024-11-17 04:52:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:06,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941210677] [2024-11-17 04:52:06,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941210677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:06,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:52:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915636235] [2024-11-17 04:52:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:06,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:52:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:52:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:06,076 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:52:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:06,136 INFO L93 Difference]: Finished difference Result 322 states and 329 transitions. [2024-11-17 04:52:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:52:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-17 04:52:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:06,138 INFO L225 Difference]: With dead ends: 322 [2024-11-17 04:52:06,138 INFO L226 Difference]: Without dead ends: 315 [2024-11-17 04:52:06,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:06,140 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 71 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:06,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 367 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:52:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-17 04:52:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 295. [2024-11-17 04:52:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 212 states have (on average 1.3962264150943395) internal successors, (296), 290 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:52:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 302 transitions. [2024-11-17 04:52:06,159 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 302 transitions. Word has length 48 [2024-11-17 04:52:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 302 transitions. [2024-11-17 04:52:06,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:52:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 302 transitions. [2024-11-17 04:52:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 04:52:06,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:06,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:52:06,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1874099345, now seen corresponding path program 1 times [2024-11-17 04:52:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490898503] [2024-11-17 04:52:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490898503] [2024-11-17 04:52:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490898503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:06,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:06,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:52:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283331483] [2024-11-17 04:52:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:06,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:06,296 INFO L87 Difference]: Start difference. First operand 295 states and 302 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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-17 04:52:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:06,846 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2024-11-17 04:52:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:52:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-17 04:52:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:06,847 INFO L225 Difference]: With dead ends: 317 [2024-11-17 04:52:06,847 INFO L226 Difference]: Without dead ends: 274 [2024-11-17 04:52:06,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:06,849 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 109 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:06,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 315 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 04:52:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-17 04:52:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 254. [2024-11-17 04:52:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 171 states have (on average 1.4795321637426901) internal successors, (253), 249 states have internal predecessors, (253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:52:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 259 transitions. [2024-11-17 04:52:06,857 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 259 transitions. Word has length 50 [2024-11-17 04:52:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:06,858 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 259 transitions. [2024-11-17 04:52:06,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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-17 04:52:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 259 transitions. [2024-11-17 04:52:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 04:52:06,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:06,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:06,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 04:52:06,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:06,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1687699808, now seen corresponding path program 1 times [2024-11-17 04:52:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872038572] [2024-11-17 04:52:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:52:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872038572] [2024-11-17 04:52:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872038572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:52:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933649437] [2024-11-17 04:52:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:52:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:52:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:06,960 INFO L87 Difference]: Start difference. First operand 254 states and 259 transitions. Second operand has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:06,979 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2024-11-17 04:52:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:52:06,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-17 04:52:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:06,981 INFO L225 Difference]: With dead ends: 256 [2024-11-17 04:52:06,981 INFO L226 Difference]: Without dead ends: 254 [2024-11-17 04:52:06,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:52:06,982 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:06,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:52:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-17 04:52:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-17 04:52:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 171 states have (on average 1.4678362573099415) internal successors, (251), 249 states have internal predecessors, (251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:52:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 257 transitions. [2024-11-17 04:52:06,990 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 257 transitions. Word has length 58 [2024-11-17 04:52:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 257 transitions. [2024-11-17 04:52:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 257 transitions. [2024-11-17 04:52:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 04:52:06,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:06,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:52:06,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash -240776391, now seen corresponding path program 1 times [2024-11-17 04:52:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688306972] [2024-11-17 04:52:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:52:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47497390] [2024-11-17 04:52:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:07,021 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-17 04:52:07,023 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-17 04:52:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:07,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:52:07,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:07,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:52:07,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688306972] [2024-11-17 04:52:07,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:52:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47497390] [2024-11-17 04:52:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47497390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:52:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050625175] [2024-11-17 04:52:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:07,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:07,242 INFO L87 Difference]: Start difference. First operand 254 states and 257 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:07,690 INFO L93 Difference]: Finished difference Result 439 states and 453 transitions. [2024-11-17 04:52:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:52:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-17 04:52:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:07,694 INFO L225 Difference]: With dead ends: 439 [2024-11-17 04:52:07,694 INFO L226 Difference]: Without dead ends: 374 [2024-11-17 04:52:07,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:07,696 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 118 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:07,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 173 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 04:52:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-17 04:52:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 365. [2024-11-17 04:52:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 280 states have (on average 1.3464285714285715) internal successors, (377), 358 states have internal predecessors, (377), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:52:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 387 transitions. [2024-11-17 04:52:07,705 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 387 transitions. Word has length 65 [2024-11-17 04:52:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:07,706 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 387 transitions. [2024-11-17 04:52:07,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 387 transitions. [2024-11-17 04:52:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 04:52:07,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:07,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:07,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 04:52:07,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:07,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:07,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1415320435, now seen corresponding path program 1 times [2024-11-17 04:52:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780860115] [2024-11-17 04:52:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:52:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:08,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780860115] [2024-11-17 04:52:08,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780860115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:08,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:08,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:52:08,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124803392] [2024-11-17 04:52:08,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:08,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:08,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:08,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:08,048 INFO L87 Difference]: Start difference. First operand 365 states and 387 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:12,036 INFO L93 Difference]: Finished difference Result 366 states and 387 transitions. [2024-11-17 04:52:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:52:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-17 04:52:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:12,039 INFO L225 Difference]: With dead ends: 366 [2024-11-17 04:52:12,039 INFO L226 Difference]: Without dead ends: 365 [2024-11-17 04:52:12,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:12,040 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 61 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:12,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 348 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-17 04:52:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-17 04:52:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-17 04:52:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 358 states have internal predecessors, (376), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:52:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 386 transitions. [2024-11-17 04:52:12,051 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 386 transitions. Word has length 72 [2024-11-17 04:52:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:12,052 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 386 transitions. [2024-11-17 04:52:12,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 386 transitions. [2024-11-17 04:52:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 04:52:12,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:12,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:12,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 04:52:12,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 925260593, now seen corresponding path program 1 times [2024-11-17 04:52:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243442856] [2024-11-17 04:52:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:52:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243442856] [2024-11-17 04:52:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243442856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:52:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:52:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133578167] [2024-11-17 04:52:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:12,140 INFO L87 Difference]: Start difference. First operand 365 states and 386 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:12,237 INFO L93 Difference]: Finished difference Result 366 states and 386 transitions. [2024-11-17 04:52:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:52:12,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2024-11-17 04:52:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:12,239 INFO L225 Difference]: With dead ends: 366 [2024-11-17 04:52:12,239 INFO L226 Difference]: Without dead ends: 365 [2024-11-17 04:52:12,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:52:12,240 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 55 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:12,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 333 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:52:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-17 04:52:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-17 04:52:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 280 states have (on average 1.3392857142857142) internal successors, (375), 358 states have internal predecessors, (375), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:52:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 385 transitions. [2024-11-17 04:52:12,249 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 385 transitions. Word has length 73 [2024-11-17 04:52:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 385 transitions. [2024-11-17 04:52:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 385 transitions. [2024-11-17 04:52:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 04:52:12,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:12,251 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:12,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 04:52:12,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:12,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -661709136, now seen corresponding path program 1 times [2024-11-17 04:52:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000473391] [2024-11-17 04:52:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:52:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000473391] [2024-11-17 04:52:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000473391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:52:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551791395] [2024-11-17 04:52:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:12,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:12,386 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-17 04:52:12,387 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-17 04:52:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 04:52:12,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:12,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:52:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551791395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:52:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-17 04:52:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379222351] [2024-11-17 04:52:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:52:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:52:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:52:12,615 INFO L87 Difference]: Start difference. First operand 365 states and 385 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:12,644 INFO L93 Difference]: Finished difference Result 365 states and 385 transitions. [2024-11-17 04:52:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:52:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2024-11-17 04:52:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:12,646 INFO L225 Difference]: With dead ends: 365 [2024-11-17 04:52:12,646 INFO L226 Difference]: Without dead ends: 364 [2024-11-17 04:52:12,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 04:52:12,647 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 137 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:12,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 387 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:52:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-17 04:52:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-17 04:52:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 280 states have (on average 1.332142857142857) internal successors, (373), 357 states have internal predecessors, (373), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:52:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 383 transitions. [2024-11-17 04:52:12,657 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 383 transitions. Word has length 76 [2024-11-17 04:52:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 383 transitions. [2024-11-17 04:52:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 383 transitions. [2024-11-17 04:52:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 04:52:12,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:12,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:12,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:52:12,860 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,SelfDestructingSolverStorable9 [2024-11-17 04:52:12,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:12,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 961853452, now seen corresponding path program 1 times [2024-11-17 04:52:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9054291] [2024-11-17 04:52:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:52:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9054291] [2024-11-17 04:52:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9054291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:52:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148989762] [2024-11-17 04:52:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:12,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:12,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:12,978 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-17 04:52:12,979 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-17 04:52:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:13,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 04:52:13,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:13,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:52:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148989762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:52:13,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:52:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-17 04:52:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226469208] [2024-11-17 04:52:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:13,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:52:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:52:13,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:52:13,140 INFO L87 Difference]: Start difference. First operand 364 states and 383 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:13,190 INFO L93 Difference]: Finished difference Result 494 states and 518 transitions. [2024-11-17 04:52:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:52:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-17 04:52:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:13,192 INFO L225 Difference]: With dead ends: 494 [2024-11-17 04:52:13,192 INFO L226 Difference]: Without dead ends: 493 [2024-11-17 04:52:13,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:52:13,193 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 135 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:13,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 902 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:52:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-17 04:52:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 453. [2024-11-17 04:52:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 367 states have (on average 1.3433242506811989) internal successors, (493), 445 states have internal predecessors, (493), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 04:52:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 507 transitions. [2024-11-17 04:52:13,206 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 507 transitions. Word has length 77 [2024-11-17 04:52:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:13,207 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 507 transitions. [2024-11-17 04:52:13,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 507 transitions. [2024-11-17 04:52:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-17 04:52:13,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:13,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:13,225 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-17 04:52:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:13,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:13,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1380916561, now seen corresponding path program 1 times [2024-11-17 04:52:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054002320] [2024-11-17 04:52:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:52:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361288442] [2024-11-17 04:52:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:13,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:13,441 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-17 04:52:13,442 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-17 04:52:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:13,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:52:13,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:13,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:52:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:14,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054002320] [2024-11-17 04:52:14,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:52:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361288442] [2024-11-17 04:52:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361288442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:52:14,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:52:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-17 04:52:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467067560] [2024-11-17 04:52:14,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:52:14,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:52:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:52:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:52:14,121 INFO L87 Difference]: Start difference. First operand 453 states and 507 transitions. Second operand has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 8 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:15,409 INFO L93 Difference]: Finished difference Result 479 states and 527 transitions. [2024-11-17 04:52:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 04:52:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 8 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-17 04:52:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:15,413 INFO L225 Difference]: With dead ends: 479 [2024-11-17 04:52:15,415 INFO L226 Difference]: Without dead ends: 470 [2024-11-17 04:52:15,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-17 04:52:15,415 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 430 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:15,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 280 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 04:52:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-17 04:52:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2024-11-17 04:52:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 375 states have (on average 1.3093333333333332) internal successors, (491), 450 states have internal predecessors, (491), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 04:52:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 505 transitions. [2024-11-17 04:52:15,428 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 505 transitions. Word has length 118 [2024-11-17 04:52:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:15,429 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 505 transitions. [2024-11-17 04:52:15,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 8 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 505 transitions. [2024-11-17 04:52:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-17 04:52:15,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:15,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:15,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 04:52:15,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:15,631 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash -84079761, now seen corresponding path program 1 times [2024-11-17 04:52:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961306851] [2024-11-17 04:52:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:52:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348201516] [2024-11-17 04:52:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:15,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:15,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:15,661 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-17 04:52:15,664 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-17 04:52:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:15,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:52:15,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:52:16,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:52:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 04:52:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961306851] [2024-11-17 04:52:16,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:52:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348201516] [2024-11-17 04:52:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348201516] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 04:52:16,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:52:16,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-17 04:52:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386181579] [2024-11-17 04:52:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:52:16,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:52:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:52:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:52:16,461 INFO L87 Difference]: Start difference. First operand 458 states and 505 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:21,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:27,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:37,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:39,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:41,680 INFO L93 Difference]: Finished difference Result 458 states and 505 transitions. [2024-11-17 04:52:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:52:41,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2024-11-17 04:52:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:41,682 INFO L225 Difference]: With dead ends: 458 [2024-11-17 04:52:41,682 INFO L226 Difference]: Without dead ends: 456 [2024-11-17 04:52:41,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:52:41,683 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:41,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 3 Unknown, 0 Unchecked, 25.2s Time] [2024-11-17 04:52:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-17 04:52:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-11-17 04:52:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 375 states have (on average 1.2933333333333332) internal successors, (485), 448 states have internal predecessors, (485), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 04:52:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 499 transitions. [2024-11-17 04:52:41,700 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 499 transitions. Word has length 120 [2024-11-17 04:52:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:41,702 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 499 transitions. [2024-11-17 04:52:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:52:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 499 transitions. [2024-11-17 04:52:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-17 04:52:41,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:41,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:41,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 04:52:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-17 04:52:41,908 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607815, now seen corresponding path program 1 times [2024-11-17 04:52:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773511] [2024-11-17 04:52:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:41,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:52:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740782584] [2024-11-17 04:52:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:41,935 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-17 04:52:41,937 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-17 04:52:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:41,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:52:42,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:42,396 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-17 04:52:42,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:52:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773511] [2024-11-17 04:52:42,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:52:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740782584] [2024-11-17 04:52:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740782584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:52:42,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:52:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-17 04:52:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024651756] [2024-11-17 04:52:42,666 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-17 04:52:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:52:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:52:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:52:42,668 INFO L87 Difference]: Start difference. First operand 456 states and 499 transitions. Second operand has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:52:43,137 INFO L93 Difference]: Finished difference Result 463 states and 508 transitions. [2024-11-17 04:52:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:52:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-17 04:52:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:52:43,141 INFO L225 Difference]: With dead ends: 463 [2024-11-17 04:52:43,141 INFO L226 Difference]: Without dead ends: 442 [2024-11-17 04:52:43,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:52:43,142 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:52:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 73 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 04:52:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-17 04:52:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 427. [2024-11-17 04:52:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 367 states have (on average 1.20708446866485) internal successors, (443), 419 states have internal predecessors, (443), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 04:52:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 457 transitions. [2024-11-17 04:52:43,156 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 457 transitions. Word has length 127 [2024-11-17 04:52:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:52:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 457 transitions. [2024-11-17 04:52:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:52:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 457 transitions. [2024-11-17 04:52:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-17 04:52:43,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:52:43,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:52:43,175 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-17 04:52:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:43,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-17 04:52:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:52:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1697896081, now seen corresponding path program 1 times [2024-11-17 04:52:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:52:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90138787] [2024-11-17 04:52:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:52:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:52:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440017579] [2024-11-17 04:52:43,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:52:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:52:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:52:43,381 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-17 04:52:43,383 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-17 04:52:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:52:43,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 04:52:43,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:52:43,832 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-17 04:52:43,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:52:45,122 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-17 04:52:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:52:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90138787] [2024-11-17 04:52:45,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:52:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440017579] [2024-11-17 04:52:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440017579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:52:45,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:52:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-17 04:52:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903964758] [2024-11-17 04:52:45,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:52:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 04:52:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:52:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 04:52:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:52:45,125 INFO L87 Difference]: Start difference. First operand 427 states and 457 transitions. Second operand has 10 states, 9 states have (on average 26.444444444444443) internal successors, (238), 10 states have internal predecessors, (238), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:52:49,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:53,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:52:57,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:01,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:05,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:09,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:13,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:17,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:20,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:23,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:28,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:32,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:36,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:53:40,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []