./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:27:25,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:27:25,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:27:25,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:27:25,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:27:25,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:27:25,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:27:25,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:27:25,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:27:25,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:27:25,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:27:25,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:27:25,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:27:25,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:27:25,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:27:25,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:27:25,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:27:25,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:27:25,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:27:25,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:27:25,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:27:25,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:27:25,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:27:25,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:27:25,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:27:25,989 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:27:25,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:27:25,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:27:25,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:27:25,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:27:25,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:27:25,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:27:25,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:27:25,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:27:26,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:27:26,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:27:26,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:27:26,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:27:26,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:27:26,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:27:26,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:27:26,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:27:26,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:27:26,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:27:26,008 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-clean/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-clean/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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2024-10-11 20:27:26,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:27:26,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:27:26,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:27:26,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:27:26,274 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:27:26,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-10-11 20:27:27,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:27:27,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:27:27,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-10-11 20:27:27,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b15b54776/2a63079ac97545c59433519365eda547/FLAG0fafb4630 [2024-10-11 20:27:28,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b15b54776/2a63079ac97545c59433519365eda547 [2024-10-11 20:27:28,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:27:28,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:27:28,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:27:28,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:27:28,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:27:28,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410b5a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28, skipping insertion in model container [2024-10-11 20:27:28,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:27:28,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:27:28,483 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:27:28,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:27:28,524 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:27:28,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28 WrapperNode [2024-10-11 20:27:28,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:27:28,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:27:28,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:27:28,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:27:28,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,562 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-11 20:27:28,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:27:28,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:27:28,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:27:28,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:27:28,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,599 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-10-11 20:27:28,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:27:28,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:27:28,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:27:28,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:27:28,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (1/1) ... [2024-10-11 20:27:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:27:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:28,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:27:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:27:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:27:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:27:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:27:28,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:27:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:27:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:27:28,780 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:27:28,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:27:28,998 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 20:27:28,998 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:27:29,036 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:27:29,039 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:27:29,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:29 BoogieIcfgContainer [2024-10-11 20:27:29,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:27:29,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:27:29,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:27:29,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:27:29,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:28" (1/3) ... [2024-10-11 20:27:29,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be31565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:29, skipping insertion in model container [2024-10-11 20:27:29,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:28" (2/3) ... [2024-10-11 20:27:29,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be31565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:29, skipping insertion in model container [2024-10-11 20:27:29,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:29" (3/3) ... [2024-10-11 20:27:29,051 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2024-10-11 20:27:29,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:27:29,068 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 20:27:29,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:27:29,139 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;@971bfb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:27:29,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 20:27:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 40 states have internal predecessors, (52), 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-10-11 20:27:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:27:29,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:29,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:29,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:29,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash -247214566, now seen corresponding path program 1 times [2024-10-11 20:27:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206086658] [2024-10-11 20:27:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206086658] [2024-10-11 20:27:29,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206086658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:29,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892193604] [2024-10-11 20:27:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:29,414 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 40 states have internal predecessors, (52), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:27:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:29,524 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-11 20:27:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:27:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:29,533 INFO L225 Difference]: With dead ends: 68 [2024-10-11 20:27:29,533 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:27:29,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 20:27:29,539 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:29,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:27:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:27:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 20:27:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 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-10-11 20:27:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-11 20:27:29,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 9 [2024-10-11 20:27:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:29,573 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-11 20:27:29,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 20:27:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-11 20:27:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:27:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:29,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:27:29,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 926283120, now seen corresponding path program 1 times [2024-10-11 20:27:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664508906] [2024-10-11 20:27:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:29,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664508906] [2024-10-11 20:27:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664508906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:29,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182637900] [2024-10-11 20:27:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:29,651 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-11 20:27:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:29,707 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-11 20:27:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-11 20:27:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:29,709 INFO L225 Difference]: With dead ends: 39 [2024-10-11 20:27:29,713 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:27:29,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 20:27:29,715 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:29,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:27:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:27:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.4) internal successors, (35), 34 states have internal predecessors, (35), 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-10-11 20:27:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-11 20:27:29,722 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 10 [2024-10-11 20:27:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:29,722 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-11 20:27:29,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-11 20:27:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-11 20:27:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:27:29,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:29,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:27:29,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1349994276, now seen corresponding path program 1 times [2024-10-11 20:27:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407167988] [2024-10-11 20:27:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407167988] [2024-10-11 20:27:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407167988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:29,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:29,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253986523] [2024-10-11 20:27:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:29,809 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-11 20:27:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:29,828 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-10-11 20:27:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-10-11 20:27:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:29,830 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:27:29,830 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:27:29,830 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-10-11 20:27:29,832 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:29,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:27:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 20:27:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.36) internal successors, (34), 33 states have internal predecessors, (34), 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-10-11 20:27:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-10-11 20:27:29,837 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 11 [2024-10-11 20:27:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:29,838 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-10-11 20:27:29,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-11 20:27:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-10-11 20:27:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:27:29,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:29,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:29,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:27:29,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:29,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1099850482, now seen corresponding path program 1 times [2024-10-11 20:27:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018268565] [2024-10-11 20:27:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018268565] [2024-10-11 20:27:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018268565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:29,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:29,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333264891] [2024-10-11 20:27:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:29,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:29,984 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 20:27:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,016 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-10-11 20:27:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-11 20:27:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,019 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:27:30,019 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 20:27:30,019 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-10-11 20:27:30,021 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 20:27:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 20:27:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 32 states have internal predecessors, (33), 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-10-11 20:27:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-11 20:27:30,033 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 12 [2024-10-11 20:27:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,033 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-11 20:27:30,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 20:27:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-11 20:27:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:27:30,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:27:30,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -264373346, now seen corresponding path program 1 times [2024-10-11 20:27:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768353956] [2024-10-11 20:27:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768353956] [2024-10-11 20:27:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768353956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:27:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80213490] [2024-10-11 20:27:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:30,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:27:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:27:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:27:30,109 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-10-11 20:27:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,137 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-11 20:27:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:27:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-10-11 20:27:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,138 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:27:30,138 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:27:30,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:27:30,140 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:27:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 20:27:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 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-10-11 20:27:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-11 20:27:30,145 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 13 [2024-10-11 20:27:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-11 20:27:30,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-10-11 20:27:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-11 20:27:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:27:30,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:30,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:27:30,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 394360948, now seen corresponding path program 1 times [2024-10-11 20:27:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113503102] [2024-10-11 20:27:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113503102] [2024-10-11 20:27:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113503102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:30,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:30,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:27:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273410045] [2024-10-11 20:27:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:30,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:27:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:27:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:27:30,212 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 20:27:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,227 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-11 20:27:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:27:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-11 20:27:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,228 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:27:30,229 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 20:27:30,229 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-10-11 20:27:30,230 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 20:27:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 20:27:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 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-10-11 20:27:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-11 20:27:30,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 14 [2024-10-11 20:27:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-11 20:27:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 20:27:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-11 20:27:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:27:30,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,238 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] [2024-10-11 20:27:30,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:27:30,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 601469736, now seen corresponding path program 1 times [2024-10-11 20:27:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494344154] [2024-10-11 20:27:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494344154] [2024-10-11 20:27:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494344154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:30,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:27:30,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809116056] [2024-10-11 20:27:30,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:30,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:27:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:27:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:27:30,345 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 20:27:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,375 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-11 20:27:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:27:30,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2024-10-11 20:27:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,379 INFO L225 Difference]: With dead ends: 34 [2024-10-11 20:27:30,379 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:27:30,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:27:30,380 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:27:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 20:27:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 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-10-11 20:27:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-11 20:27:30,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2024-10-11 20:27:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,393 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-11 20:27:30,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 20:27:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-11 20:27:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:27:30,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,395 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] [2024-10-11 20:27:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:27:30,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1465692732, now seen corresponding path program 1 times [2024-10-11 20:27:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533779759] [2024-10-11 20:27:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:27:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533779759] [2024-10-11 20:27:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533779759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:27:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680243740] [2024-10-11 20:27:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:27:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:27:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:27:30,502 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-10-11 20:27:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,551 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 20:27:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:27:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2024-10-11 20:27:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,553 INFO L225 Difference]: With dead ends: 41 [2024-10-11 20:27:30,553 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:27:30,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:27:30,556 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:27:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 20:27:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 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-10-11 20:27:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-11 20:27:30,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 23 [2024-10-11 20:27:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,569 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-11 20:27:30,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-10-11 20:27:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-10-11 20:27:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:27:30,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,570 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:27:30,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:27:30,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash -729117782, now seen corresponding path program 1 times [2024-10-11 20:27:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852550317] [2024-10-11 20:27:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:27:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852550317] [2024-10-11 20:27:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852550317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591217984] [2024-10-11 20:27:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:30,675 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:30,702 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-11 20:27:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:30,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 20:27:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:30,703 INFO L225 Difference]: With dead ends: 43 [2024-10-11 20:27:30,703 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:27:30,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-11 20:27:30,704 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:27:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 20:27:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 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-10-11 20:27:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-10-11 20:27:30,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 31 [2024-10-11 20:27:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:30,718 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-10-11 20:27:30,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-10-11 20:27:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:27:30,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:30,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 20:27:30,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:27:30,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:30,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 364987358, now seen corresponding path program 1 times [2024-10-11 20:27:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019901657] [2024-10-11 20:27:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:27:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019901657] [2024-10-11 20:27:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019901657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894090024] [2024-10-11 20:27:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:30,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:30,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:30,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:27:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:30,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:27:30,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:27:31,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:27:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894090024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:31,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-10-11 20:27:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552974942] [2024-10-11 20:27:31,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:27:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:31,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:27:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:27:31,228 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 20:27:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:31,408 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-10-11 20:27:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:27:31,408 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 40 [2024-10-11 20:27:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:31,410 INFO L225 Difference]: With dead ends: 80 [2024-10-11 20:27:31,410 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:27:31,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:27:31,411 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:31,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:27:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:27:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-11 20:27:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:27:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2024-10-11 20:27:31,425 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 40 [2024-10-11 20:27:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:31,425 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-10-11 20:27:31,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 20:27:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-10-11 20:27:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 20:27:31,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:31,427 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:31,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:27:31,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:27:31,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:31,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2061739188, now seen corresponding path program 1 times [2024-10-11 20:27:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467423060] [2024-10-11 20:27:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:31,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467423060] [2024-10-11 20:27:31,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467423060] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448226460] [2024-10-11 20:27:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:31,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:31,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:31,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:27:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:31,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:27:31,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:31,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:27:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448226460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:27:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:27:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875425904] [2024-10-11 20:27:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:27:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:27:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:27:31,910 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:27:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:31,941 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-10-11 20:27:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:27:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-10-11 20:27:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:31,943 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:27:31,943 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:27:31,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:27:31,944 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:31,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:27:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 20:27:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:27:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2024-10-11 20:27:31,952 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 48 [2024-10-11 20:27:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2024-10-11 20:27:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:27:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2024-10-11 20:27:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 20:27:31,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:31,956 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:31,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:27:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:32,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:32,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash 510594723, now seen corresponding path program 1 times [2024-10-11 20:27:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030912965] [2024-10-11 20:27:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030912965] [2024-10-11 20:27:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030912965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768874340] [2024-10-11 20:27:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:32,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:32,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:27:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:27:32,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:32,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768874340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:32,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:27:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712351242] [2024-10-11 20:27:32,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:27:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:27:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:27:32,412 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 20:27:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:32,473 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-11 20:27:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:27:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-10-11 20:27:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:32,475 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:27:32,475 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:27:32,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:27:32,476 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:32,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:27:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:27:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 20:27:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 58 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:27:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-10-11 20:27:32,484 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 49 [2024-10-11 20:27:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:32,485 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-10-11 20:27:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 20:27:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-10-11 20:27:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 20:27:32,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:32,487 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:32,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:27:32,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:32,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1774626944, now seen corresponding path program 1 times [2024-10-11 20:27:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822444234] [2024-10-11 20:27:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:27:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:27:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:27:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 20:27:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:27:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:27:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822444234] [2024-10-11 20:27:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822444234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672800841] [2024-10-11 20:27:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:32,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:32,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:27:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:33,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:27:33,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:27:33,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:27:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672800841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:33,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-11 20:27:33,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363186549] [2024-10-11 20:27:33,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:27:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:27:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:27:33,415 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-10-11 20:27:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:33,650 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2024-10-11 20:27:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 20:27:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 98 [2024-10-11 20:27:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:33,652 INFO L225 Difference]: With dead ends: 136 [2024-10-11 20:27:33,653 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 20:27:33,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:27:33,655 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:33,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 179 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:27:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 20:27:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-10-11 20:27:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.09) internal successors, (109), 102 states have internal predecessors, (109), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:27:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2024-10-11 20:27:33,677 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 98 [2024-10-11 20:27:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:33,677 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2024-10-11 20:27:33,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-10-11 20:27:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2024-10-11 20:27:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 20:27:33,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:33,683 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:33,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:27:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:27:33,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 314513797, now seen corresponding path program 2 times [2024-10-11 20:27:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113353026] [2024-10-11 20:27:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:27:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:27:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:27:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 20:27:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:27:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:27:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113353026] [2024-10-11 20:27:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113353026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969146216] [2024-10-11 20:27:34,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:27:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:34,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:34,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:27:34,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:27:34,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:27:34,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:27:34,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-11 20:27:34,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-11 20:27:34,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969146216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:34,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:34,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2024-10-11 20:27:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893417246] [2024-10-11 20:27:34,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:34,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:27:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:27:34,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:27:34,366 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-10-11 20:27:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:34,581 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2024-10-11 20:27:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:27:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 100 [2024-10-11 20:27:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:34,583 INFO L225 Difference]: With dead ends: 128 [2024-10-11 20:27:34,583 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 20:27:34,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:27:34,584 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:34,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 173 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:27:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 20:27:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 20:27:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.02) internal successors, (102), 101 states have internal predecessors, (102), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:27:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-10-11 20:27:34,594 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 100 [2024-10-11 20:27:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:34,595 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-10-11 20:27:34,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-10-11 20:27:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-10-11 20:27:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 20:27:34,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:34,597 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:34,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:27:34,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:27:34,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:34,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1380283038, now seen corresponding path program 2 times [2024-10-11 20:27:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359370288] [2024-10-11 20:27:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:27:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:27:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:27:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 20:27:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:27:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:27:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:27:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 20:27:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:27:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 20:27:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:27:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 20:27:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:27:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 20:27:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:27:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 20:27:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 20:27:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 20:27:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359370288] [2024-10-11 20:27:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359370288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085624743] [2024-10-11 20:27:35,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:27:35,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:35,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:35,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:35,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:27:35,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:27:35,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:27:35,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:27:35,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 20:27:35,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 20:27:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085624743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:36,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2024-10-11 20:27:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477117683] [2024-10-11 20:27:36,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 20:27:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 20:27:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=1237, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:27:36,372 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-10-11 20:27:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:36,740 INFO L93 Difference]: Finished difference Result 252 states and 327 transitions. [2024-10-11 20:27:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 20:27:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) Word has length 210 [2024-10-11 20:27:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:36,743 INFO L225 Difference]: With dead ends: 252 [2024-10-11 20:27:36,743 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 20:27:36,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1008, Invalid=1542, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 20:27:36,745 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:36,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 183 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:27:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 20:27:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-11 20:27:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 196 states have (on average 1.010204081632653) internal successors, (198), 197 states have internal predecessors, (198), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:27:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2024-10-11 20:27:36,770 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 210 [2024-10-11 20:27:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:36,771 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2024-10-11 20:27:36,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-10-11 20:27:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2024-10-11 20:27:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-11 20:27:36,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:36,780 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:36,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:27:36,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:27:36,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 189838848, now seen corresponding path program 2 times [2024-10-11 20:27:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410011706] [2024-10-11 20:27:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:27:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:27:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:27:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 20:27:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:27:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:27:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:27:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 20:27:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:27:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 20:27:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:27:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 20:27:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:27:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 20:27:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:27:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 20:27:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 20:27:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 20:27:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-11 20:27:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:27:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:27:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 20:27:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 20:27:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 20:27:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 20:27:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 20:27:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-11 20:27:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-11 20:27:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-10-11 20:27:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:27:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-10-11 20:27:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-11 20:27:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-11 20:27:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-11 20:27:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 20:27:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-11 20:27:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 20:27:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-11 20:27:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-10-11 20:27:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-10-11 20:27:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-11 20:27:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-10-11 20:27:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-11 20:27:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-10-11 20:27:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-11 20:27:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410011706] [2024-10-11 20:27:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410011706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206928572] [2024-10-11 20:27:38,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:27:38,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:38,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:38,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:38,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:27:38,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:27:38,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:27:38,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 20:27:38,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-11 20:27:39,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-11 20:27:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206928572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:40,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2024-10-11 20:27:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920883647] [2024-10-11 20:27:40,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:40,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-10-11 20:27:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-10-11 20:27:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3173, Invalid=3967, Unknown=0, NotChecked=0, Total=7140 [2024-10-11 20:27:40,749 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-10-11 20:27:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:41,433 INFO L93 Difference]: Finished difference Result 489 states and 643 transitions. [2024-10-11 20:27:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 20:27:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) Word has length 438 [2024-10-11 20:27:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:41,439 INFO L225 Difference]: With dead ends: 489 [2024-10-11 20:27:41,440 INFO L226 Difference]: Without dead ends: 487 [2024-10-11 20:27:41,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3504, Invalid=4506, Unknown=0, NotChecked=0, Total=8010 [2024-10-11 20:27:41,443 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:41,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:27:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-11 20:27:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-10-11 20:27:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 381 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-11 20:27:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 590 transitions. [2024-10-11 20:27:41,480 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 590 transitions. Word has length 438 [2024-10-11 20:27:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 590 transitions. [2024-10-11 20:27:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-10-11 20:27:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 590 transitions. [2024-10-11 20:27:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2024-10-11 20:27:41,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:41,516 INFO L215 NwaCegarLoop]: trace histogram [103, 103, 103, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:41,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:27:41,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:41,721 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:27:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 752209310, now seen corresponding path program 3 times [2024-10-11 20:27:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641841377] [2024-10-11 20:27:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:27:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:27:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:27:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:27:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:27:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:27:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:27:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 20:27:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:27:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:27:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:27:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 20:27:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:27:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 20:27:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:27:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 20:27:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:27:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 20:27:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:27:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 20:27:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 20:27:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 20:27:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-11 20:27:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:27:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:27:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 20:27:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 20:27:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 20:27:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 20:27:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 20:27:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-11 20:27:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-11 20:27:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-10-11 20:27:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:27:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-10-11 20:27:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-11 20:27:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-11 20:27:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-11 20:27:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 20:27:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-11 20:27:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 20:27:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-11 20:27:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-10-11 20:27:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-10-11 20:27:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-11 20:27:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-10-11 20:27:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-11 20:27:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-10-11 20:27:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 20:27:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2024-10-11 20:27:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-10-11 20:27:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2024-10-11 20:27:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2024-10-11 20:27:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-10-11 20:27:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-10-11 20:27:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 499 [2024-10-11 20:27:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-11 20:27:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2024-10-11 20:27:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-10-11 20:27:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-10-11 20:27:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-10-11 20:27:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-10-11 20:27:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-10-11 20:27:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2024-10-11 20:27:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2024-10-11 20:27:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2024-10-11 20:27:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 594 [2024-10-11 20:27:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2024-10-11 20:27:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2024-10-11 20:27:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2024-10-11 20:27:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-10-11 20:27:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635 [2024-10-11 20:27:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 645 [2024-10-11 20:27:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-10-11 20:27:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2024-10-11 20:27:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-11 20:27:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 679 [2024-10-11 20:27:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 686 [2024-10-11 20:27:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 696 [2024-10-11 20:27:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2024-10-11 20:27:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2024-10-11 20:27:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 720 [2024-10-11 20:27:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2024-10-11 20:27:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-10-11 20:27:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-10-11 20:27:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2024-10-11 20:27:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2024-10-11 20:27:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 771 [2024-10-11 20:27:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 781 [2024-10-11 20:27:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2024-10-11 20:27:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 798 [2024-10-11 20:27:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 805 [2024-10-11 20:27:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 815 [2024-10-11 20:27:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 822 [2024-10-11 20:27:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-10-11 20:27:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 839 [2024-10-11 20:27:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 849 [2024-10-11 20:27:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-10-11 20:27:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 866 [2024-10-11 20:27:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 873 [2024-10-11 20:27:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 883 [2024-10-11 20:27:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 0 proven. 11679 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2024-10-11 20:27:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641841377] [2024-10-11 20:27:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641841377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:45,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040684772] [2024-10-11 20:27:45,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:27:45,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:45,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:45,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:27:46,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:27:46,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:27:46,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:27:46,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 303 proven. 407 refuted. 0 times theorem prover too weak. 31981 trivial. 0 not checked. [2024-10-11 20:27:46,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:27:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 303 proven. 407 refuted. 0 times theorem prover too weak. 31981 trivial. 0 not checked. [2024-10-11 20:27:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040684772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:27:47,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:27:47,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 67 [2024-10-11 20:27:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424687673] [2024-10-11 20:27:47,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:27:47,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-11 20:27:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:47,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-11 20:27:47,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 20:27:47,795 INFO L87 Difference]: Start difference. First operand 487 states and 590 transitions. Second operand has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-10-11 20:27:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:48,011 INFO L93 Difference]: Finished difference Result 487 states and 590 transitions. [2024-10-11 20:27:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:27:48,012 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) Word has length 890 [2024-10-11 20:27:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:48,015 INFO L225 Difference]: With dead ends: 487 [2024-10-11 20:27:48,015 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:27:48,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 1974 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2241, Invalid=3459, Unknown=0, NotChecked=0, Total=5700 [2024-10-11 20:27:48,022 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:48,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 102 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:27:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:27:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:27:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:27:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:27:48,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 890 [2024-10-11 20:27:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:48,024 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:27:48,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-10-11 20:27:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:27:48,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:27:48,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-11 20:27:48,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-11 20:27:48,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-11 20:27:48,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-11 20:27:48,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-11 20:27:48,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-11 20:27:48,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-11 20:27:48,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:27:48,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:27:48,233 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:48,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:27:49,057 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:27:49,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:27:49 BoogieIcfgContainer [2024-10-11 20:27:49,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:27:49,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:27:49,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:27:49,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:27:49,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:29" (3/4) ... [2024-10-11 20:27:49,077 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:27:49,080 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:27:49,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:27:49,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:27:49,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:27:49,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:27:49,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:27:49,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:27:49,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:27:49,176 INFO L158 Benchmark]: Toolchain (without parser) took 20928.12ms. Allocated memory was 184.5MB in the beginning and 463.5MB in the end (delta: 278.9MB). Free memory was 127.7MB in the beginning and 270.8MB in the end (delta: -143.1MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,176 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:27:49,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.56ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 114.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 113.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,177 INFO L158 Benchmark]: Boogie Preprocessor took 51.84ms. Allocated memory is still 184.5MB. Free memory was 113.0MB in the beginning and 111.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:27:49,177 INFO L158 Benchmark]: RCFGBuilder took 424.45ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 97.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,177 INFO L158 Benchmark]: TraceAbstraction took 20031.07ms. Allocated memory was 184.5MB in the beginning and 463.5MB in the end (delta: 278.9MB). Free memory was 96.6MB in the beginning and 275.0MB in the end (delta: -178.4MB). Peak memory consumption was 226.4MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,178 INFO L158 Benchmark]: Witness Printer took 101.64ms. Allocated memory is still 463.5MB. Free memory was 275.0MB in the beginning and 270.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:27:49,180 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.56ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 114.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 113.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.84ms. Allocated memory is still 184.5MB. Free memory was 113.0MB in the beginning and 111.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 424.45ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 97.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20031.07ms. Allocated memory was 184.5MB in the beginning and 463.5MB in the end (delta: 278.9MB). Free memory was 96.6MB in the beginning and 275.0MB in the end (delta: -178.4MB). Peak memory consumption was 226.4MB. Max. memory is 16.1GB. * Witness Printer took 101.64ms. Allocated memory is still 463.5MB. Free memory was 275.0MB in the beginning and 270.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 17, TraceHistogramMax: 103, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 1898 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1476 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 422 mSDtfsCounter, 1568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4317 GetRequests, 3993 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=16, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 3891 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5684 ConstructedInterpolants, 0 QuantifiedInterpolants, 12121 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1938 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 104680/127193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((1 <= p) && (i == 0)) && (((long long) p + bufsize) <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen)) || ((((((((1 <= p) && (1 <= i)) && (i <= 2147483646)) && (bufsize <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:27:49,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE