./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-023d838-m [2024-11-10 19:33:09,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:33:09,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:33:09,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:33:09,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:33:09,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:33:09,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:33:09,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:33:09,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:33:09,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:33:09,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:33:09,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:33:09,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:33:09,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:33:09,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:33:09,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:33:09,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:33:09,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:33:09,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:33:09,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:33:09,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:33:09,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:33:09,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:33:09,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:33:09,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:33:09,644 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:33:09,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:33:09,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:33:09,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:33:09,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:33:09,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:33:09,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:33:09,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:33:09,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:33:09,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:33:09,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:33:09,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:33:09,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:33:09,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:33:09,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:33:09,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:33:09,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:33:09,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:33:09,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:33:09,650 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-10 19:33:09,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:33:09,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:33:09,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:33:09,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:33:09,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:33:09,914 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-10 19:33:11,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:33:11,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:33:11,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c [2024-11-10 19:33:11,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9876a14/68372b223a4b4606a16a79233064807c/FLAG31124c4a0 [2024-11-10 19:33:11,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9876a14/68372b223a4b4606a16a79233064807c [2024-11-10 19:33:11,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:33:11,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:33:11,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:33:11,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:33:11,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:33:11,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573175ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11, skipping insertion in model container [2024-11-10 19:33:11,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:33:11,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:33:11,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:33:11,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:33:11,883 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:33:11,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11 WrapperNode [2024-11-10 19:33:11,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:33:11,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:33:11,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:33:11,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:33:11,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,927 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2024-11-10 19:33:11,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:33:11,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:33:11,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:33:11,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:33:11,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,956 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:33:11,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:33:11,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:33:11,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:33:11,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:33:11,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (1/1) ... [2024-11-10 19:33:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:33:11,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:12,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:33:12,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:33:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:33:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:33:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:33:12,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:33:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:33:12,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:33:12,114 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:33:12,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:33:12,668 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-10 19:33:12,669 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:33:12,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:33:12,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:33:12,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:33:12 BoogieIcfgContainer [2024-11-10 19:33:12,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:33:12,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:33:12,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:33:12,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:33:12,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:33:11" (1/3) ... [2024-11-10 19:33:12,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13448ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:33:12, skipping insertion in model container [2024-11-10 19:33:12,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:11" (2/3) ... [2024-11-10 19:33:12,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13448ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:33:12, skipping insertion in model container [2024-11-10 19:33:12,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:33:12" (3/3) ... [2024-11-10 19:33:12,706 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound1.c [2024-11-10 19:33:12,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:33:12,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-11-10 19:33:12,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:33:12,808 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;@552379b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:33:12,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-10 19:33:12,813 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-10 19:33:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:33:12,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:12,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:33:12,819 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-10 19:33:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -958419874, now seen corresponding path program 1 times [2024-11-10 19:33:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664991427] [2024-11-10 19:33:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664991427] [2024-11-10 19:33:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664991427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:33:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653803661] [2024-11-10 19:33:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:33:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:33:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:33:12,982 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-10 19:33:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:13,018 INFO L93 Difference]: Finished difference Result 435 states and 474 transitions. [2024-11-10 19:33:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:33:13,021 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-10 19:33:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:13,029 INFO L225 Difference]: With dead ends: 435 [2024-11-10 19:33:13,029 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 19:33:13,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:33:13,037 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-10 19:33:13,038 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-10 19:33:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 19:33:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-10 19:33:13,082 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-10 19:33:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2024-11-10 19:33:13,087 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 6 [2024-11-10 19:33:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:13,087 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2024-11-10 19:33:13,088 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-10 19:33:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2024-11-10 19:33:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:33:13,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:13,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:33:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:33:13,089 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-10 19:33:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -958390083, now seen corresponding path program 1 times [2024-11-10 19:33:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13262277] [2024-11-10 19:33:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13262277] [2024-11-10 19:33:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13262277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:33:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798552218] [2024-11-10 19:33:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:13,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:13,234 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-10 19:33:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:13,337 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2024-11-10 19:33:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:33:13,337 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-10 19:33:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:13,339 INFO L225 Difference]: With dead ends: 292 [2024-11-10 19:33:13,339 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 19:33:13,339 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-10 19:33:13,341 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:33:13,341 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.1s Time] [2024-11-10 19:33:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 19:33:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-10 19:33:13,360 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-10 19:33:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2024-11-10 19:33:13,363 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 6 [2024-11-10 19:33:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2024-11-10 19:33:13,364 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-10 19:33:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2024-11-10 19:33:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 19:33:13,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:13,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:33:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:33:13,366 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-10 19:33:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash 613401913, now seen corresponding path program 1 times [2024-11-10 19:33:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926310699] [2024-11-10 19:33:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926310699] [2024-11-10 19:33:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926310699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:33:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518423314] [2024-11-10 19:33:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:13,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:33:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:33:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:33:13,440 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-10 19:33:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:13,869 INFO L93 Difference]: Finished difference Result 367 states and 375 transitions. [2024-11-10 19:33:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:33:13,870 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-10 19:33:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:13,872 INFO L225 Difference]: With dead ends: 367 [2024-11-10 19:33:13,872 INFO L226 Difference]: Without dead ends: 303 [2024-11-10 19:33:13,873 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-10 19:33:13,874 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-10 19:33:13,874 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-10 19:33:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-10 19:33:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-11-10 19:33:13,902 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-10 19:33:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2024-11-10 19:33:13,906 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 10 [2024-11-10 19:33:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:13,907 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2024-11-10 19:33:13,907 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-10 19:33:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2024-11-10 19:33:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 19:33:13,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:13,908 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-10 19:33:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:33:13,908 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-10 19:33:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 685748275, now seen corresponding path program 1 times [2024-11-10 19:33:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045618097] [2024-11-10 19:33:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045618097] [2024-11-10 19:33:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045618097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:33:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902133661] [2024-11-10 19:33:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:33:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:33:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:33:14,058 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-10 19:33:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:14,118 INFO L93 Difference]: Finished difference Result 322 states and 329 transitions. [2024-11-10 19:33:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:33:14,119 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-10 19:33:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:14,121 INFO L225 Difference]: With dead ends: 322 [2024-11-10 19:33:14,121 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 19:33:14,121 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-10 19:33:14,122 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-10 19:33:14,123 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-10 19:33:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 19:33:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 295. [2024-11-10 19:33:14,138 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-10 19:33:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 302 transitions. [2024-11-10 19:33:14,140 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 302 transitions. Word has length 48 [2024-11-10 19:33:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:14,140 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 302 transitions. [2024-11-10 19:33:14,140 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-10 19:33:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 302 transitions. [2024-11-10 19:33:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 19:33:14,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:14,144 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-10 19:33:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:33:14,144 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-10 19:33:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1874099345, now seen corresponding path program 1 times [2024-11-10 19:33:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587522521] [2024-11-10 19:33:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587522521] [2024-11-10 19:33:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587522521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:33:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139585437] [2024-11-10 19:33:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:14,332 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-10 19:33:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:14,884 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2024-11-10 19:33:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:33:14,885 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-10 19:33:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:14,886 INFO L225 Difference]: With dead ends: 317 [2024-11-10 19:33:14,886 INFO L226 Difference]: Without dead ends: 274 [2024-11-10 19:33:14,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:14,888 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-10 19:33:14,888 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-10 19:33:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-10 19:33:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 254. [2024-11-10 19:33:14,907 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-10 19:33:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 259 transitions. [2024-11-10 19:33:14,909 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 259 transitions. Word has length 50 [2024-11-10 19:33:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:14,910 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 259 transitions. [2024-11-10 19:33:14,910 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-10 19:33:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 259 transitions. [2024-11-10 19:33:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 19:33:14,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:14,912 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-10 19:33:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:33:14,913 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-10 19:33:14,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1687699808, now seen corresponding path program 1 times [2024-11-10 19:33:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730063133] [2024-11-10 19:33:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:33:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730063133] [2024-11-10 19:33:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730063133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:33:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918948884] [2024-11-10 19:33:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:33:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:33:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:33:15,034 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-10 19:33:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:15,054 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2024-11-10 19:33:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:33:15,057 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-10 19:33:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:15,058 INFO L225 Difference]: With dead ends: 256 [2024-11-10 19:33:15,059 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 19:33:15,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:33:15,060 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-10 19:33:15,060 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-10 19:33:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 19:33:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-10 19:33:15,074 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-10 19:33:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 257 transitions. [2024-11-10 19:33:15,075 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 257 transitions. Word has length 58 [2024-11-10 19:33:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 257 transitions. [2024-11-10 19:33:15,076 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-10 19:33:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 257 transitions. [2024-11-10 19:33:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 19:33:15,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:15,078 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-10 19:33:15,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:33:15,078 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-10 19:33:15,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash -240776391, now seen corresponding path program 1 times [2024-11-10 19:33:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:15,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162131820] [2024-11-10 19:33:15,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:15,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:33:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486083594] [2024-11-10 19:33:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:15,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:33:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:15,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:33:15,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:15,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:33:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162131820] [2024-11-10 19:33:15,306 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:33:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486083594] [2024-11-10 19:33:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486083594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:33:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626884746] [2024-11-10 19:33:15,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:15,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:15,309 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-10 19:33:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:15,829 INFO L93 Difference]: Finished difference Result 439 states and 453 transitions. [2024-11-10 19:33:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:33:15,830 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-10 19:33:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:15,831 INFO L225 Difference]: With dead ends: 439 [2024-11-10 19:33:15,832 INFO L226 Difference]: Without dead ends: 374 [2024-11-10 19:33:15,832 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-10 19:33:15,833 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.5s IncrementalHoareTripleChecker+Time [2024-11-10 19:33:15,837 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.5s Time] [2024-11-10 19:33:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-10 19:33:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 365. [2024-11-10 19:33:15,851 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-10 19:33:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 387 transitions. [2024-11-10 19:33:15,853 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 387 transitions. Word has length 65 [2024-11-10 19:33:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:15,853 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 387 transitions. [2024-11-10 19:33:15,854 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-10 19:33:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 387 transitions. [2024-11-10 19:33:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 19:33:15,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:15,855 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-10 19:33:15,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:33:16,059 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-10 19:33:16,060 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-10 19:33:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1415320435, now seen corresponding path program 1 times [2024-11-10 19:33:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357513890] [2024-11-10 19:33:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:33:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:16,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357513890] [2024-11-10 19:33:16,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357513890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:16,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:16,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:33:16,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257889468] [2024-11-10 19:33:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:16,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:16,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:16,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:16,213 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-10 19:33:20,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:33:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:20,205 INFO L93 Difference]: Finished difference Result 366 states and 387 transitions. [2024-11-10 19:33:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:33:20,206 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-10 19:33:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:20,207 INFO L225 Difference]: With dead ends: 366 [2024-11-10 19:33:20,208 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 19:33:20,208 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-10 19:33:20,208 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-10 19:33:20,209 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-10 19:33:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 19:33:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-10 19:33:20,216 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-10 19:33:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 386 transitions. [2024-11-10 19:33:20,218 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 386 transitions. Word has length 72 [2024-11-10 19:33:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:20,218 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 386 transitions. [2024-11-10 19:33:20,218 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-10 19:33:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 386 transitions. [2024-11-10 19:33:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 19:33:20,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:20,220 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-10 19:33:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:33:20,220 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-10 19:33:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 925260593, now seen corresponding path program 1 times [2024-11-10 19:33:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616231806] [2024-11-10 19:33:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:33:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:33:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616231806] [2024-11-10 19:33:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616231806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:20,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:33:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:33:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523831330] [2024-11-10 19:33:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:20,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:20,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:33:20,352 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-10 19:33:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:20,456 INFO L93 Difference]: Finished difference Result 366 states and 386 transitions. [2024-11-10 19:33:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:33:20,457 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-10 19:33:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:20,459 INFO L225 Difference]: With dead ends: 366 [2024-11-10 19:33:20,459 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 19:33:20,459 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-10 19:33:20,460 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-10 19:33:20,461 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-10 19:33:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 19:33:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-10 19:33:20,471 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-10 19:33:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 385 transitions. [2024-11-10 19:33:20,473 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 385 transitions. Word has length 73 [2024-11-10 19:33:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:20,473 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 385 transitions. [2024-11-10 19:33:20,473 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-10 19:33:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 385 transitions. [2024-11-10 19:33:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 19:33:20,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:20,475 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-10 19:33:20,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:33:20,476 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-10 19:33:20,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -661709136, now seen corresponding path program 1 times [2024-11-10 19:33:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792089851] [2024-11-10 19:33:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:33:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:20,607 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-10 19:33:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792089851] [2024-11-10 19:33:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792089851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:33:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321026240] [2024-11-10 19:33:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:20,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:20,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:20,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:33:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:20,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:33:20,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:20,798 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-10 19:33:20,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:33:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321026240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:33:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 19:33:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052537132] [2024-11-10 19:33:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:20,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:33:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:33:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:33:20,800 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-10 19:33:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:20,826 INFO L93 Difference]: Finished difference Result 365 states and 385 transitions. [2024-11-10 19:33:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:33:20,827 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-10 19:33:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:20,828 INFO L225 Difference]: With dead ends: 365 [2024-11-10 19:33:20,829 INFO L226 Difference]: Without dead ends: 364 [2024-11-10 19:33:20,829 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-10 19:33:20,830 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-10 19:33:20,830 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-10 19:33:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-10 19:33:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-10 19:33:20,837 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-10 19:33:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 383 transitions. [2024-11-10 19:33:20,839 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 383 transitions. Word has length 76 [2024-11-10 19:33:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 383 transitions. [2024-11-10 19:33:20,839 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-10 19:33:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 383 transitions. [2024-11-10 19:33:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 19:33:20,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:20,840 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-10 19:33:20,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:33:21,040 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-10 19:33:21,041 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-10 19:33:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 961853452, now seen corresponding path program 1 times [2024-11-10 19:33:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599986338] [2024-11-10 19:33:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:33:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:21,167 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-10 19:33:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599986338] [2024-11-10 19:33:21,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599986338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:33:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263367555] [2024-11-10 19:33:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:21,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:33:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:21,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:33:21,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:21,330 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-10 19:33:21,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:33:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263367555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:33:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:33:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-10 19:33:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531872980] [2024-11-10 19:33:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:33:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:33:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:33:21,332 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-10 19:33:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:21,385 INFO L93 Difference]: Finished difference Result 494 states and 518 transitions. [2024-11-10 19:33:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:33:21,385 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-10 19:33:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:21,387 INFO L225 Difference]: With dead ends: 494 [2024-11-10 19:33:21,388 INFO L226 Difference]: Without dead ends: 493 [2024-11-10 19:33:21,388 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-10 19:33:21,388 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-10 19:33:21,389 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-10 19:33:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-10 19:33:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 453. [2024-11-10 19:33:21,415 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-10 19:33:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 507 transitions. [2024-11-10 19:33:21,418 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 507 transitions. Word has length 77 [2024-11-10 19:33:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:21,418 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 507 transitions. [2024-11-10 19:33:21,418 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-10 19:33:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 507 transitions. [2024-11-10 19:33:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 19:33:21,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:21,420 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-10 19:33:21,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 19:33:21,624 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-10 19:33:21,625 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-10 19:33:21,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1380916561, now seen corresponding path program 1 times [2024-11-10 19:33:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749809858] [2024-11-10 19:33:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:33:21,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311498216] [2024-11-10 19:33:21,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:21,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:21,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:21,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:21,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:33:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:21,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:33:21,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:22,075 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-10 19:33:22,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:33:22,403 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-10 19:33:22,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749809858] [2024-11-10 19:33:22,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:33:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311498216] [2024-11-10 19:33:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311498216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:33:22,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:33:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-10 19:33:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433607058] [2024-11-10 19:33:22,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:33:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:33:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:33:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:33:22,406 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-10 19:33:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:23,657 INFO L93 Difference]: Finished difference Result 479 states and 527 transitions. [2024-11-10 19:33:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:33:23,658 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-10 19:33:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:23,662 INFO L225 Difference]: With dead ends: 479 [2024-11-10 19:33:23,663 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 19:33:23,663 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-10 19:33:23,664 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 430 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-10 19:33:23,664 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-10 19:33:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 19:33:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2024-11-10 19:33:23,677 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-10 19:33:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 505 transitions. [2024-11-10 19:33:23,679 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 505 transitions. Word has length 118 [2024-11-10 19:33:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:23,680 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 505 transitions. [2024-11-10 19:33:23,680 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-10 19:33:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 505 transitions. [2024-11-10 19:33:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 19:33:23,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:23,682 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-10 19:33:23,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:33:23,886 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-10 19:33:23,887 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-10 19:33:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash -84079761, now seen corresponding path program 1 times [2024-11-10 19:33:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847326068] [2024-11-10 19:33:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:33:23,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699845866] [2024-11-10 19:33:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:23,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:23,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:33:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:23,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:33:23,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:24,350 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-10 19:33:24,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:33:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 19:33:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847326068] [2024-11-10 19:33:24,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:33:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699845866] [2024-11-10 19:33:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699845866] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 19:33:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:33:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-10 19:33:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957304619] [2024-11-10 19:33:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:33:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:33:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:33:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:33:24,770 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-10 19:33:30,134 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-10 19:33:36,029 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-10 19:33:45,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:33:47,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:33:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:49,556 INFO L93 Difference]: Finished difference Result 458 states and 505 transitions. [2024-11-10 19:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:33:49,556 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-10 19:33:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:49,558 INFO L225 Difference]: With dead ends: 458 [2024-11-10 19:33:49,558 INFO L226 Difference]: Without dead ends: 456 [2024-11-10 19:33:49,559 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-10 19:33:49,559 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s 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, 24.7s IncrementalHoareTripleChecker+Time [2024-11-10 19:33:49,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 3 Unknown, 0 Unchecked, 24.7s Time] [2024-11-10 19:33:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-10 19:33:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-11-10 19:33:49,574 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-10 19:33:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 499 transitions. [2024-11-10 19:33:49,577 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 499 transitions. Word has length 120 [2024-11-10 19:33:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:49,577 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 499 transitions. [2024-11-10 19:33:49,578 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-10 19:33:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 499 transitions. [2024-11-10 19:33:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 19:33:49,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:49,579 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-10 19:33:49,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:33:49,779 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-10 19:33:49,780 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-10 19:33:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607815, now seen corresponding path program 1 times [2024-11-10 19:33:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380426357] [2024-11-10 19:33:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:33:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224144265] [2024-11-10 19:33:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:49,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:49,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:49,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:49,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:33:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:49,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:33:49,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:33:50,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:33:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380426357] [2024-11-10 19:33:50,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:33:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224144265] [2024-11-10 19:33:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224144265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:33:50,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:33:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-10 19:33:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917915302] [2024-11-10 19:33:50,498 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:33:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:33:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:33:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:33:50,500 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-10 19:33:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:33:50,971 INFO L93 Difference]: Finished difference Result 463 states and 508 transitions. [2024-11-10 19:33:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:33:50,971 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-10 19:33:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:33:50,973 INFO L225 Difference]: With dead ends: 463 [2024-11-10 19:33:50,973 INFO L226 Difference]: Without dead ends: 442 [2024-11-10 19:33:50,974 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-10 19:33:50,974 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-10 19:33:50,974 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-10 19:33:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-10 19:33:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 427. [2024-11-10 19:33:50,986 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-10 19:33:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 457 transitions. [2024-11-10 19:33:50,988 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 457 transitions. Word has length 127 [2024-11-10 19:33:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:33:50,988 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 457 transitions. [2024-11-10 19:33:50,988 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-10 19:33:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 457 transitions. [2024-11-10 19:33:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 19:33:50,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:33:50,990 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-10 19:33:51,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:33:51,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:51,194 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-10 19:33:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:33:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1697896081, now seen corresponding path program 1 times [2024-11-10 19:33:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:33:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017924774] [2024-11-10 19:33:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:33:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:33:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819771102] [2024-11-10 19:33:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:33:51,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:33:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:33:51,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:33:51,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:33:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:33:51,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 19:33:51,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:33:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:33:51,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:33:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:33:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:33:52,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017924774] [2024-11-10 19:33:52,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:33:52,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819771102] [2024-11-10 19:33:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819771102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:33:52,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:33:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-10 19:33:52,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117100335] [2024-11-10 19:33:52,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:33:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 19:33:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:33:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 19:33:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:33:52,915 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-10 19:33:57,489 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-10 19:34:01,507 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-10 19:34:05,714 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-10 19:34:09,736 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-10 19:34:13,758 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-10 19:34:17,765 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-10 19:34:21,771 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-10 19:34:24,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:26,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:31,072 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-10 19:34:35,080 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-10 19:34:40,351 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-10 19:34:44,359 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-10 19:34:48,365 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 []