./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:52:07,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:52:07,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:52:07,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:52:07,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:52:07,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:52:07,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:52:07,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:52:07,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:52:07,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:52:07,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:52:07,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:52:07,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:52:07,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:52:07,108 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:52:07,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:52:07,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:52:07,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:52:07,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:52:07,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:52:07,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:52:07,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:52:07,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:52:07,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:52:07,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:52:07,114 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:52:07,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:52:07,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:52:07,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:52:07,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:52:07,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:52:07,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:52:07,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:52:07,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:52:07,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:07,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:52:07,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:52:07,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:52:07,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:52:07,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:52:07,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:52:07,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:52:07,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:52:07,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:52:07,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2024-11-10 18:52:07,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:52:07,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:52:07,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:52:07,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:52:07,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:52:07,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-10 18:52:08,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:52:08,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:52:08,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-10 18:52:08,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1865914a1/0b1edc8b272e4ca4b4b6dd8ed2b6ed0c/FLAG61b42528f [2024-11-10 18:52:08,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1865914a1/0b1edc8b272e4ca4b4b6dd8ed2b6ed0c [2024-11-10 18:52:08,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:52:08,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:52:08,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:08,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:52:08,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:52:08,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:08" (1/1) ... [2024-11-10 18:52:08,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d4c933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:08, skipping insertion in model container [2024-11-10 18:52:08,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:08" (1/1) ... [2024-11-10 18:52:08,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:52:09,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:09,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:52:09,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:09,246 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:52:09,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09 WrapperNode [2024-11-10 18:52:09,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:09,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:09,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:52:09,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:52:09,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,274 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-11-10 18:52:09,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:09,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:52:09,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:52:09,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:52:09,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,298 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:52:09,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:52:09,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:52:09,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:52:09,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:52:09,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (1/1) ... [2024-11-10 18:52:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:09,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:52:09,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:52:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:52:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:52:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:52:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:52:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:52:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:52:09,447 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:52:09,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:52:09,630 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-10 18:52:09,633 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:52:09,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:52:09,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:52:09,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:09 BoogieIcfgContainer [2024-11-10 18:52:09,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:52:09,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:52:09,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:52:09,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:52:09,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:52:08" (1/3) ... [2024-11-10 18:52:09,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8a424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:09, skipping insertion in model container [2024-11-10 18:52:09,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:09" (2/3) ... [2024-11-10 18:52:09,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8a424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:09, skipping insertion in model container [2024-11-10 18:52:09,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:09" (3/3) ... [2024-11-10 18:52:09,660 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2024-11-10 18:52:09,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:52:09,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-10 18:52:09,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:52:09,720 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;@15052df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:52:09,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 18:52:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 49 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:52:09,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:09,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:09,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash 122463153, now seen corresponding path program 1 times [2024-11-10 18:52:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:09,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005055235] [2024-11-10 18:52:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:09,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:09,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005055235] [2024-11-10 18:52:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005055235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659474135] [2024-11-10 18:52:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:09,952 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 49 states have internal predecessors, (61), 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.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-11-10 18:52:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,039 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2024-11-10 18:52:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:10,041 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-11-10 18:52:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,049 INFO L225 Difference]: With dead ends: 85 [2024-11-10 18:52:10,053 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 18:52:10,055 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-11-10 18:52:10,061 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 18:52:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-10 18:52:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-10 18:52:10,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 10 [2024-11-10 18:52:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-10 18:52:10,139 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-11-10 18:52:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-10 18:52:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 18:52:10,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:52:10,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -498609546, now seen corresponding path program 1 times [2024-11-10 18:52:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663790227] [2024-11-10 18:52:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663790227] [2024-11-10 18:52:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663790227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249161852] [2024-11-10 18:52:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:10,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,267 INFO L87 Difference]: Start difference. First operand 45 states and 46 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-11-10 18:52:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,315 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-10 18:52:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:10,315 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-11-10 18:52:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,316 INFO L225 Difference]: With dead ends: 45 [2024-11-10 18:52:10,316 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 18:52:10,316 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-11-10 18:52:10,317 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 71 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 18:52:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 18:52:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-11-10 18:52:10,322 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 11 [2024-11-10 18:52:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-11-10 18:52:10,322 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-11-10 18:52:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-11-10 18:52:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 18:52:10,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:52:10,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1872563636, now seen corresponding path program 1 times [2024-11-10 18:52:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109027860] [2024-11-10 18:52:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,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-11-10 18:52:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109027860] [2024-11-10 18:52:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109027860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115243816] [2024-11-10 18:52:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,378 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-10 18:52:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,412 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2024-11-10 18:52:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-10 18:52:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,413 INFO L225 Difference]: With dead ends: 44 [2024-11-10 18:52:10,413 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 18:52:10,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,415 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 18:52:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 18:52:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-11-10 18:52:10,419 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 13 [2024-11-10 18:52:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,419 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-11-10 18:52:10,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-10 18:52:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-11-10 18:52:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 18:52:10,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:52:10,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2080069426, now seen corresponding path program 1 times [2024-11-10 18:52:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681929093] [2024-11-10 18:52:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681929093] [2024-11-10 18:52:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681929093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307328218] [2024-11-10 18:52:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,470 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-10 18:52:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,484 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-10 18:52:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-10 18:52:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,485 INFO L225 Difference]: With dead ends: 43 [2024-11-10 18:52:10,485 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 18:52:10,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,486 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 18:52:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 18:52:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-10 18:52:10,490 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 14 [2024-11-10 18:52:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,491 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-10 18:52:10,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-10 18:52:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-10 18:52:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 18:52:10,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:52:10,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1786925716, now seen corresponding path program 1 times [2024-11-10 18:52:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307296126] [2024-11-10 18:52:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307296126] [2024-11-10 18:52:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307296126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973129642] [2024-11-10 18:52:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:10,526 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,534 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-10 18:52:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:10,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-10 18:52:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,536 INFO L225 Difference]: With dead ends: 42 [2024-11-10 18:52:10,536 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 18:52:10,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:10,537 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 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-11-10 18:52:10,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 18:52:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 18:52:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-10 18:52:10,540 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 16 [2024-11-10 18:52:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-10 18:52:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-10 18:52:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:52:10,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:52:10,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 439877649, now seen corresponding path program 1 times [2024-11-10 18:52:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527101218] [2024-11-10 18:52:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527101218] [2024-11-10 18:52:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527101218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144549339] [2024-11-10 18:52:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:10,568 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,580 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-10 18:52:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-10 18:52:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,582 INFO L225 Difference]: With dead ends: 41 [2024-11-10 18:52:10,582 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 18:52:10,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:10,583 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 18:52:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 18:52:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-10 18:52:10,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 17 [2024-11-10 18:52:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,590 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-10 18:52:10,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-10 18:52:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 18:52:10,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:52:10,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -896797463, now seen corresponding path program 1 times [2024-11-10 18:52:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135769132] [2024-11-10 18:52:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135769132] [2024-11-10 18:52:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135769132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:52:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153384043] [2024-11-10 18:52:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:52:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:52:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:52:10,656 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,691 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-10 18:52:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:52:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2024-11-10 18:52:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,692 INFO L225 Difference]: With dead ends: 40 [2024-11-10 18:52:10,692 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 18:52:10,693 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-11-10 18:52:10,693 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 18:52:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 18:52:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) 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-11-10 18:52:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-10 18:52:10,697 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 26 [2024-11-10 18:52:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,698 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-10 18:52:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-10 18:52:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 18:52:10,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:52:10,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2030917594, now seen corresponding path program 1 times [2024-11-10 18:52:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663394691] [2024-11-10 18:52:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663394691] [2024-11-10 18:52:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663394691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:52:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963645624] [2024-11-10 18:52:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:52:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:52:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:52:10,770 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,807 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-10 18:52:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:52:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2024-11-10 18:52:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,808 INFO L225 Difference]: With dead ends: 49 [2024-11-10 18:52:10,808 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 18:52:10,809 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-11-10 18:52:10,809 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 18:52:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-10 18:52:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-10 18:52:10,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2024-11-10 18:52:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-10 18:52:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-10 18:52:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 18:52:10,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,816 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, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:52:10,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 480571268, now seen corresponding path program 1 times [2024-11-10 18:52:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566099965] [2024-11-10 18:52:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566099965] [2024-11-10 18:52:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566099965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:10,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:10,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594873096] [2024-11-10 18:52:10,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:10,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:10,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:10,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:10,877 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:10,894 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-11-10 18:52:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 36 [2024-11-10 18:52:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:10,896 INFO L225 Difference]: With dead ends: 52 [2024-11-10 18:52:10,896 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 18:52:10,896 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-11-10 18:52:10,897 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:10,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 18:52:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-10 18:52:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 43 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-10 18:52:10,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 36 [2024-11-10 18:52:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:10,902 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-10 18:52:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-10 18:52:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 18:52:10,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:10,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:10,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:52:10,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2053261838, now seen corresponding path program 1 times [2024-11-10 18:52:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328205332] [2024-11-10 18:52:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:52:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328205332] [2024-11-10 18:52:11,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328205332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379036150] [2024-11-10 18:52:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:11,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:11,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:52:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:11,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:52:11,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:52:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379036150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:11,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-11-10 18:52:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56933634] [2024-11-10 18:52:11,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:11,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:52:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:52:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:52:11,412 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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-11-10 18:52:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:11,574 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2024-11-10 18:52:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:52:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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 47 [2024-11-10 18:52:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:11,576 INFO L225 Difference]: With dead ends: 99 [2024-11-10 18:52:11,576 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 18:52:11,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 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-11-10 18:52:11,577 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:11,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 187 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 18:52:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2024-11-10 18:52:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 78 states have internal predecessors, (85), 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-11-10 18:52:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2024-11-10 18:52:11,584 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 47 [2024-11-10 18:52:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2024-11-10 18:52:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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-11-10 18:52:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2024-11-10 18:52:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 18:52:11,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:11,586 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:11,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:52:11,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 18:52:11,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 684257948, now seen corresponding path program 1 times [2024-11-10 18:52:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:11,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594187302] [2024-11-10 18:52:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:11,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594187302] [2024-11-10 18:52:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594187302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993810005] [2024-11-10 18:52:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:11,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:11,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:52:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:11,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:11,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:12,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:52:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993810005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:52:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:52:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368564100] [2024-11-10 18:52:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:52:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:52:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:12,017 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:52:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:12,044 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2024-11-10 18:52:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:52:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 56 [2024-11-10 18:52:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:12,045 INFO L225 Difference]: With dead ends: 91 [2024-11-10 18:52:12,045 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 18:52:12,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:12,046 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:12,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 18:52:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 18:52:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.08) internal successors, (81), 77 states have internal predecessors, (81), 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-11-10 18:52:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-11-10 18:52:12,063 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 56 [2024-11-10 18:52:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-11-10 18:52:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:52:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-11-10 18:52:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 18:52:12,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:12,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:12,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:52:12,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 18:52:12,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash -262840119, now seen corresponding path program 1 times [2024-11-10 18:52:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115091232] [2024-11-10 18:52:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115091232] [2024-11-10 18:52:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115091232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043531872] [2024-11-10 18:52:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:12,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:52:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:12,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:12,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043531872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:12,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:52:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226556851] [2024-11-10 18:52:12,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:52:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:52:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:52:12,463 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 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-11-10 18:52:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:12,552 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-10 18:52:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:52:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 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 57 [2024-11-10 18:52:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:12,553 INFO L225 Difference]: With dead ends: 91 [2024-11-10 18:52:12,553 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 18:52:12,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 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-11-10 18:52:12,554 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:12,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 18:52:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 18:52:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.04) internal successors, (78), 77 states have internal predecessors, (78), 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-11-10 18:52:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-11-10 18:52:12,560 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 57 [2024-11-10 18:52:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:12,561 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-11-10 18:52:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 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-11-10 18:52:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-11-10 18:52:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 18:52:12,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:12,562 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:12,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:52:12,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:12,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash 417140806, now seen corresponding path program 1 times [2024-11-10 18:52:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:12,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849397738] [2024-11-10 18:52:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:52:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 18:52:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 18:52:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 18:52:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 18:52:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 18:52:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849397738] [2024-11-10 18:52:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849397738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106031138] [2024-11-10 18:52:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:12,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:12,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:12,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:12,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:52:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:13,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:52:13,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 18:52:13,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 18:52:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106031138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:13,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-10 18:52:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315766112] [2024-11-10 18:52:13,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 18:52:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 18:52:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:52:13,385 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 25 states, 24 states have (on average 7.958333333333333) internal successors, (191), 25 states have internal predecessors, (191), 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-11-10 18:52:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:13,587 INFO L93 Difference]: Finished difference Result 173 states and 207 transitions. [2024-11-10 18:52:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 18:52:13,588 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.958333333333333) internal successors, (191), 25 states have internal predecessors, (191), 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 114 [2024-11-10 18:52:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:13,589 INFO L225 Difference]: With dead ends: 173 [2024-11-10 18:52:13,589 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 18:52:13,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2024-11-10 18:52:13,590 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:13,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 259 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 18:52:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2024-11-10 18:52:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.0656934306569343) internal successors, (146), 139 states have internal predecessors, (146), 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-11-10 18:52:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2024-11-10 18:52:13,599 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 114 [2024-11-10 18:52:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2024-11-10 18:52:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.958333333333333) internal successors, (191), 25 states have internal predecessors, (191), 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-11-10 18:52:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2024-11-10 18:52:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 18:52:13,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:13,601 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:13,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:52:13,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:13,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1701341313, now seen corresponding path program 2 times [2024-11-10 18:52:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824012365] [2024-11-10 18:52:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:52:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 18:52:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 18:52:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 18:52:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 18:52:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 18:52:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824012365] [2024-11-10 18:52:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824012365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814826527] [2024-11-10 18:52:14,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:52:14,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:14,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:14,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:52:14,084 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:52:14,085 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:14,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:52:14,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 18:52:14,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 18:52:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814826527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:14,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2024-11-10 18:52:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755314858] [2024-11-10 18:52:14,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:14,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 18:52:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:14,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 18:52:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:52:14,524 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand has 18 states, 17 states have (on average 7.882352941176471) internal successors, (134), 18 states have internal predecessors, (134), 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-11-10 18:52:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:14,863 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2024-11-10 18:52:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 18:52:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.882352941176471) internal successors, (134), 18 states have internal predecessors, (134), 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 117 [2024-11-10 18:52:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:14,866 INFO L225 Difference]: With dead ends: 165 [2024-11-10 18:52:14,866 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 18:52:14,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-11-10 18:52:14,867 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:14,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 183 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 18:52:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-10 18:52:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 138 states have internal predecessors, (139), 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-11-10 18:52:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2024-11-10 18:52:14,877 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 117 [2024-11-10 18:52:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:14,878 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2024-11-10 18:52:14,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.882352941176471) internal successors, (134), 18 states have internal predecessors, (134), 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-11-10 18:52:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2024-11-10 18:52:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-10 18:52:14,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:14,884 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:14,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 18:52:15,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 757842206, now seen corresponding path program 2 times [2024-11-10 18:52:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492503984] [2024-11-10 18:52:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:52:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 18:52:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 18:52:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 18:52:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 18:52:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 18:52:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 18:52:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 18:52:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:52:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 18:52:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 18:52:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 18:52:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 18:52:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 18:52:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-10 18:52:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-10 18:52:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 18:52:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 18:52:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492503984] [2024-11-10 18:52:15,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492503984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778889751] [2024-11-10 18:52:15,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:52:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:15,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:15,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:15,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:52:15,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:52:15,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:15,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 18:52:15,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 18:52:15,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 18:52:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778889751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:16,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2024-11-10 18:52:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130150069] [2024-11-10 18:52:16,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:16,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 18:52:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 18:52:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=1237, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 18:52:16,302 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand has 46 states, 45 states have (on average 8.777777777777779) internal successors, (395), 46 states have internal predecessors, (395), 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-11-10 18:52:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:16,690 INFO L93 Difference]: Finished difference Result 331 states and 406 transitions. [2024-11-10 18:52:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 18:52:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 8.777777777777779) internal successors, (395), 46 states have internal predecessors, (395), 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 247 [2024-11-10 18:52:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:16,693 INFO L225 Difference]: With dead ends: 331 [2024-11-10 18:52:16,693 INFO L226 Difference]: Without dead ends: 329 [2024-11-10 18:52:16,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1008, Invalid=1542, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 18:52:16,694 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:16,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 322 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:52:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-10 18:52:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-10 18:52:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 275 states have (on average 1.0072727272727273) internal successors, (277), 276 states have internal predecessors, (277), 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-11-10 18:52:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 379 transitions. [2024-11-10 18:52:16,721 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 379 transitions. Word has length 247 [2024-11-10 18:52:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 379 transitions. [2024-11-10 18:52:16,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 8.777777777777779) internal successors, (395), 46 states have internal predecessors, (395), 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-11-10 18:52:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 379 transitions. [2024-11-10 18:52:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2024-11-10 18:52:16,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:16,729 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:16,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:52:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 18:52:16,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 326532646, now seen corresponding path program 2 times [2024-11-10 18:52:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36389039] [2024-11-10 18:52:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:52:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 18:52:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 18:52:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 18:52:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 18:52:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 18:52:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 18:52:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 18:52:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:52:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 18:52:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 18:52:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 18:52:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 18:52:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 18:52:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-10 18:52:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-10 18:52:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 18:52:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 18:52:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 18:52:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 18:52:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-10 18:52:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-10 18:52:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-10 18:52:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-10 18:52:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-10 18:52:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-10 18:52:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-10 18:52:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-10 18:52:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-10 18:52:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-10 18:52:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-11-10 18:52:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-10 18:52:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-10 18:52:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-11-10 18:52:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-10 18:52:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 18:52:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-10 18:52:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 18:52:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2024-11-10 18:52:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-10 18:52:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2024-11-10 18:52:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2024-11-10 18:52:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-10 18:52:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-11-10 18:52:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-10 18:52:18,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36389039] [2024-11-10 18:52:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36389039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439963359] [2024-11-10 18:52:18,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:52:18,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:18,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:18,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 18:52:18,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:52:18,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:18,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 18:52:18,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-10 18:52:19,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-10 18:52:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439963359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:20,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2024-11-10 18:52:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307208242] [2024-11-10 18:52:20,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:20,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-11-10 18:52:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-11-10 18:52:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3173, Invalid=3967, Unknown=0, NotChecked=0, Total=7140 [2024-11-10 18:52:20,302 INFO L87 Difference]: Start difference. First operand 329 states and 379 transitions. Second operand has 85 states, 84 states have (on average 9.416666666666666) internal successors, (791), 85 states have internal predecessors, (791), 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-11-10 18:52:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:21,376 INFO L93 Difference]: Finished difference Result 646 states and 800 transitions. [2024-11-10 18:52:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-10 18:52:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 9.416666666666666) internal successors, (791), 85 states have internal predecessors, (791), 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 514 [2024-11-10 18:52:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:21,384 INFO L225 Difference]: With dead ends: 646 [2024-11-10 18:52:21,384 INFO L226 Difference]: Without dead ends: 644 [2024-11-10 18:52:21,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3504, Invalid=4506, Unknown=0, NotChecked=0, Total=8010 [2024-11-10 18:52:21,389 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:21,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 497 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 18:52:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-10 18:52:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-11-10 18:52:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 537 states have (on average 1.0037243947858474) internal successors, (539), 538 states have internal predecessors, (539), 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-11-10 18:52:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 747 transitions. [2024-11-10 18:52:21,438 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 747 transitions. Word has length 514 [2024-11-10 18:52:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:21,440 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 747 transitions. [2024-11-10 18:52:21,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 9.416666666666666) internal successors, (791), 85 states have internal predecessors, (791), 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-11-10 18:52:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 747 transitions. [2024-11-10 18:52:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2024-11-10 18:52:21,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:21,484 INFO L215 NwaCegarLoop]: trace histogram [103, 103, 103, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:21,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:21,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:21,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 992083294, now seen corresponding path program 3 times [2024-11-10 18:52:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158827806] [2024-11-10 18:52:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:52:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:52:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:52:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:52:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:52:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 18:52:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 18:52:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 18:52:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 18:52:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 18:52:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 18:52:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 18:52:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:52:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 18:52:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 18:52:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 18:52:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 18:52:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 18:52:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-10 18:52:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-10 18:52:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 18:52:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 18:52:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 18:52:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 18:52:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-10 18:52:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-10 18:52:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-10 18:52:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-10 18:52:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-10 18:52:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-10 18:52:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-10 18:52:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-10 18:52:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-10 18:52:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-10 18:52:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-11-10 18:52:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-10 18:52:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-10 18:52:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-11-10 18:52:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-10 18:52:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 18:52:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-10 18:52:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 18:52:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2024-11-10 18:52:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-10 18:52:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2024-11-10 18:52:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2024-11-10 18:52:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-10 18:52:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-11-10 18:52:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2024-11-10 18:52:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2024-11-10 18:52:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 18:52:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-10 18:52:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-10 18:52:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2024-11-10 18:52:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 580 [2024-11-10 18:52:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-11-10 18:52:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 18:52:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2024-11-10 18:52:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2024-11-10 18:52:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2024-11-10 18:52:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2024-11-10 18:52:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-10 18:52:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 660 [2024-11-10 18:52:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2024-11-10 18:52:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-10 18:52:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 687 [2024-11-10 18:52:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2024-11-10 18:52:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2024-11-10 18:52:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 720 [2024-11-10 18:52:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 727 [2024-11-10 18:52:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 740 [2024-11-10 18:52:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-10 18:52:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 760 [2024-11-10 18:52:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 767 [2024-11-10 18:52:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-10 18:52:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 787 [2024-11-10 18:52:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 800 [2024-11-10 18:52:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2024-11-10 18:52:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 820 [2024-11-10 18:52:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 827 [2024-11-10 18:52:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 840 [2024-11-10 18:52:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2024-11-10 18:52:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 860 [2024-11-10 18:52:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 867 [2024-11-10 18:52:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-10 18:52:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 887 [2024-11-10 18:52:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 900 [2024-11-10 18:52:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 907 [2024-11-10 18:52:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 920 [2024-11-10 18:52:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 927 [2024-11-10 18:52:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 940 [2024-11-10 18:52:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 947 [2024-11-10 18:52:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 960 [2024-11-10 18:52:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 967 [2024-11-10 18:52:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 980 [2024-11-10 18:52:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 987 [2024-11-10 18:52:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1000 [2024-11-10 18:52:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1007 [2024-11-10 18:52:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1020 [2024-11-10 18:52:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1027 [2024-11-10 18:52:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1040 [2024-11-10 18:52:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36567 backedges. 0 proven. 15555 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2024-11-10 18:52:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158827806] [2024-11-10 18:52:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158827806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721095860] [2024-11-10 18:52:25,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:52:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:25,209 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:25,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 18:52:25,284 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-10 18:52:25,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:25,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:52:25,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36567 backedges. 303 proven. 558 refuted. 0 times theorem prover too weak. 35706 trivial. 0 not checked. [2024-11-10 18:52:25,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36567 backedges. 303 proven. 558 refuted. 0 times theorem prover too weak. 35706 trivial. 0 not checked. [2024-11-10 18:52:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721095860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:26,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 67 [2024-11-10 18:52:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243063316] [2024-11-10 18:52:26,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-10 18:52:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-10 18:52:26,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 18:52:26,952 INFO L87 Difference]: Start difference. First operand 644 states and 747 transitions. Second operand has 68 states, 67 states have (on average 9.029850746268657) internal successors, (605), 68 states have internal predecessors, (605), 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-11-10 18:52:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:27,202 INFO L93 Difference]: Finished difference Result 644 states and 747 transitions. [2024-11-10 18:52:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:52:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 9.029850746268657) internal successors, (605), 68 states have internal predecessors, (605), 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 1047 [2024-11-10 18:52:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:27,204 INFO L225 Difference]: With dead ends: 644 [2024-11-10 18:52:27,204 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:52:27,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2363 GetRequests, 2288 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2241, Invalid=3459, Unknown=0, NotChecked=0, Total=5700 [2024-11-10 18:52:27,213 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:27,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 235 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:52:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:52:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:52:27,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1047 [2024-11-10 18:52:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:52:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 9.029850746268657) internal successors, (605), 68 states have internal predecessors, (605), 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-11-10 18:52:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:52:27,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:52:27,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-10 18:52:27,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-10 18:52:27,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-10 18:52:27,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-10 18:52:27,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:27,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 18:52:27,427 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:27,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:52:28,085 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:52:28,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:52:28 BoogieIcfgContainer [2024-11-10 18:52:28,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:52:28,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:52:28,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:52:28,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:52:28,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:09" (3/4) ... [2024-11-10 18:52:28,100 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:52:28,103 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 18:52:28,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 18:52:28,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:52:28,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:52:28,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:52:28,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:52:28,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:52:28,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:52:28,197 INFO L158 Benchmark]: Toolchain (without parser) took 19226.58ms. Allocated memory was 151.0MB in the beginning and 633.3MB in the end (delta: 482.3MB). Free memory was 78.5MB in the beginning and 418.9MB in the end (delta: -340.4MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,197 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 151.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:52:28,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.97ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 78.3MB in the beginning and 212.0MB in the end (delta: -133.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.31ms. Allocated memory is still 243.3MB. Free memory was 212.0MB in the beginning and 210.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,198 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 243.3MB. Free memory was 210.9MB in the beginning and 208.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,198 INFO L158 Benchmark]: IcfgBuilder took 342.50ms. Allocated memory is still 243.3MB. Free memory was 208.8MB in the beginning and 195.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,198 INFO L158 Benchmark]: TraceAbstraction took 18444.92ms. Allocated memory was 243.3MB in the beginning and 633.3MB in the end (delta: 390.1MB). Free memory was 194.1MB in the beginning and 423.1MB in the end (delta: -228.9MB). Peak memory consumption was 366.9MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,199 INFO L158 Benchmark]: Witness Printer took 98.55ms. Allocated memory is still 633.3MB. Free memory was 423.1MB in the beginning and 418.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:52:28,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 151.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.97ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 78.3MB in the beginning and 212.0MB in the end (delta: -133.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.31ms. Allocated memory is still 243.3MB. Free memory was 212.0MB in the beginning and 210.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 243.3MB. Free memory was 210.9MB in the beginning and 208.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 342.50ms. Allocated memory is still 243.3MB. Free memory was 208.8MB in the beginning and 195.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18444.92ms. Allocated memory was 243.3MB in the beginning and 633.3MB in the end (delta: 390.1MB). Free memory was 194.1MB in the beginning and 423.1MB in the end (delta: -228.9MB). Peak memory consumption was 366.9MB. Max. memory is 16.1GB. * Witness Printer took 98.55ms. Allocated memory is still 633.3MB. Free memory was 423.1MB in the beginning and 418.9MB 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: 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 - 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: 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 17, TraceHistogramMax: 103, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 2744 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2213 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1909 IncrementalHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 531 mSDtfsCounter, 1909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4961 GetRequests, 4637 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred 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, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 4568 NumberOfCodeBlocks, 3494 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6679 ConstructedInterpolants, 0 QuantifiedInterpolants, 15146 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1990 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 112176/142062 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]: Location Invariant Derived location invariant: null - 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-11-10 18:52:28,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE