./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:08:19,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:08:19,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:08:19,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:08:19,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:08:19,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:08:19,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:08:19,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:08:19,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:08:19,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:08:19,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:08:19,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:08:19,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:08:19,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:08:19,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:08:19,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:08:19,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:08:19,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:08:19,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:08:19,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:08:19,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:08:19,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:08:19,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:08:19,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:08:19,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:08:19,509 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:08:19,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:08:19,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:08:19,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:08:19,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:08:19,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:08:19,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:08:19,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:08:19,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:08:19,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:08:19,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:08:19,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:08:19,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:08:19,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:08:19,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:08:19,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:08:19,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:08:19,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:08:19,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:08:19,515 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c [2024-11-09 12:08:19,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:08:19,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:08:19,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:08:19,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:08:19,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:08:19,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c [2024-11-09 12:08:21,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:08:21,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:08:21,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c [2024-11-09 12:08:21,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d52b2ed3/769902dfbe2e48d08115fc8bb1aeb4b8/FLAGbfb18d798 [2024-11-09 12:08:21,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d52b2ed3/769902dfbe2e48d08115fc8bb1aeb4b8 [2024-11-09 12:08:21,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:08:21,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:08:21,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:08:21,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:08:21,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:08:21,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6773f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21, skipping insertion in model container [2024-11-09 12:08:21,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:08:21,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:08:21,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:08:21,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:08:21,839 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:08:21,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21 WrapperNode [2024-11-09 12:08:21,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:08:21,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:08:21,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:08:21,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:08:21,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,903 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-11-09 12:08:21,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:08:21,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:08:21,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:08:21,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:08:21,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,950 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-09 12:08:21,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:08:21,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:08:21,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:08:21,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:08:21,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (1/1) ... [2024-11-09 12:08:21,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:08:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:22,056 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-09 12:08:22,068 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-09 12:08:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:08:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:08:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:08:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:08:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:08:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:08:22,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:08:22,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:08:22,818 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-09 12:08:22,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:08:22,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:08:22,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:08:22,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:08:22 BoogieIcfgContainer [2024-11-09 12:08:22,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:08:22,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:08:22,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:08:22,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:08:22,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:08:21" (1/3) ... [2024-11-09 12:08:22,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b25418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:08:22, skipping insertion in model container [2024-11-09 12:08:22,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:21" (2/3) ... [2024-11-09 12:08:22,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b25418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:08:22, skipping insertion in model container [2024-11-09 12:08:22,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:08:22" (3/3) ... [2024-11-09 12:08:22,855 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound1.c [2024-11-09 12:08:22,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:08:22,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-11-09 12:08:22,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:08:22,945 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;@56ee4a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:08:22,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-09 12:08:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:08:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:08:22,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:22,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:08:22,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-09 12:08:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552414201] [2024-11-09 12:08:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:23,076 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-09 12:08:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552414201] [2024-11-09 12:08:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552414201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:23,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:23,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004589061] [2024-11-09 12:08:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:23,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:08:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:08:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:08:23,113 INFO L87 Difference]: Start difference. First operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:23,161 INFO L93 Difference]: Finished difference Result 427 states and 466 transitions. [2024-11-09 12:08:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:08:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 12:08:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:23,172 INFO L225 Difference]: With dead ends: 427 [2024-11-09 12:08:23,172 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 12:08:23,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:08:23,184 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:23,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:08:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 12:08:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 12:08:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 192 states have internal predecessors, (194), 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-09 12:08:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2024-11-09 12:08:23,234 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 6 [2024-11-09 12:08:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:23,234 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2024-11-09 12:08:23,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2024-11-09 12:08:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:08:23,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:23,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:08:23,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:08:23,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:23,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-09 12:08:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433918284] [2024-11-09 12:08:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:23,339 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-09 12:08:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433918284] [2024-11-09 12:08:23,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433918284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:23,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564004369] [2024-11-09 12:08:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:23,347 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:23,405 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2024-11-09 12:08:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:08:23,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 12:08:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:23,412 INFO L225 Difference]: With dead ends: 196 [2024-11-09 12:08:23,412 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 12:08:23,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:08:23,414 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 194 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:23,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:08:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 12:08:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-09 12:08:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 191 states have internal predecessors, (193), 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-09 12:08:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2024-11-09 12:08:23,426 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 6 [2024-11-09 12:08:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:23,428 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2024-11-09 12:08:23,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2024-11-09 12:08:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 12:08:23,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:23,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:08:23,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-09 12:08:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16959997] [2024-11-09 12:08:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:23,502 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-09 12:08:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16959997] [2024-11-09 12:08:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16959997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516164889] [2024-11-09 12:08:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:23,505 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 12:08:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:23,587 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2024-11-09 12:08:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:08:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-09 12:08:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:23,591 INFO L225 Difference]: With dead ends: 285 [2024-11-09 12:08:23,591 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 12:08:23,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:08:23,593 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:23,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:08:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 12:08:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-09 12:08:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.6694915254237288) internal successors, (197), 195 states have internal predecessors, (197), 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-09 12:08:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2024-11-09 12:08:23,612 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 7 [2024-11-09 12:08:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-11-09 12:08:23,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 12:08:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2024-11-09 12:08:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 12:08:23,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:23,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:23,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:08:23,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:23,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1182784684, now seen corresponding path program 1 times [2024-11-09 12:08:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224251283] [2024-11-09 12:08:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:23,692 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-09 12:08:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224251283] [2024-11-09 12:08:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224251283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483073688] [2024-11-09 12:08:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:23,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:08:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:08:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:08:23,694 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:24,135 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2024-11-09 12:08:24,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:08:24,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 12:08:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:24,137 INFO L225 Difference]: With dead ends: 359 [2024-11-09 12:08:24,137 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 12:08:24,137 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-09 12:08:24,139 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:24,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 141 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:08:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 12:08:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2024-11-09 12:08:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 207 states have (on average 1.429951690821256) internal successors, (296), 284 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:08:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 302 transitions. [2024-11-09 12:08:24,159 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 302 transitions. Word has length 9 [2024-11-09 12:08:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 302 transitions. [2024-11-09 12:08:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:08:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 302 transitions. [2024-11-09 12:08:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 12:08:24,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:24,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:08:24,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1158660914, now seen corresponding path program 1 times [2024-11-09 12:08:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232582329] [2024-11-09 12:08:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:24,294 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-09 12:08:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232582329] [2024-11-09 12:08:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232582329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038444574] [2024-11-09 12:08:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:24,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:08:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:08:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:08:24,297 INFO L87 Difference]: Start difference. First operand 289 states and 302 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-09 12:08:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:24,362 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions. [2024-11-09 12:08:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:08:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2024-11-09 12:08:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:24,365 INFO L225 Difference]: With dead ends: 313 [2024-11-09 12:08:24,365 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 12:08:24,365 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-09 12:08:24,369 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:24,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:08:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 12:08:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288. [2024-11-09 12:08:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 283 states have internal predecessors, (289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:08:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 295 transitions. [2024-11-09 12:08:24,384 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 295 transitions. Word has length 47 [2024-11-09 12:08:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:24,385 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 295 transitions. [2024-11-09 12:08:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-09 12:08:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 295 transitions. [2024-11-09 12:08:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 12:08:24,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:24,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:08:24,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:24,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1076612948, now seen corresponding path program 1 times [2024-11-09 12:08:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:24,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072618186] [2024-11-09 12:08:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:24,554 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-09 12:08:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072618186] [2024-11-09 12:08:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072618186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:08:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440388629] [2024-11-09 12:08:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:24,559 INFO L87 Difference]: Start difference. First operand 288 states and 295 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-09 12:08:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:24,758 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2024-11-09 12:08:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:08:24,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-11-09 12:08:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:24,761 INFO L225 Difference]: With dead ends: 308 [2024-11-09 12:08:24,761 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 12:08:24,762 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-09 12:08:24,763 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 154 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:24,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:08:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 12:08:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-11-09 12:08:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.490909090909091) internal successors, (246), 242 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:08:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions. [2024-11-09 12:08:24,783 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 49 [2024-11-09 12:08:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:24,784 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions. [2024-11-09 12:08:24,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-09 12:08:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions. [2024-11-09 12:08:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 12:08:24,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:24,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:24,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:08:24,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1058568341, now seen corresponding path program 1 times [2024-11-09 12:08:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825754301] [2024-11-09 12:08:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:08:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:24,907 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-09 12:08:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825754301] [2024-11-09 12:08:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825754301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:24,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:08:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841762421] [2024-11-09 12:08:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:08:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:08:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:08:24,911 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-09 12:08:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:24,934 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2024-11-09 12:08:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:08:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 57 [2024-11-09 12:08:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:24,936 INFO L225 Difference]: With dead ends: 249 [2024-11-09 12:08:24,937 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 12:08:24,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:08:24,938 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:24,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:08:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 12:08:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-09 12:08:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.4787878787878788) internal successors, (244), 242 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:08:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions. [2024-11-09 12:08:24,954 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 57 [2024-11-09 12:08:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:24,955 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions. [2024-11-09 12:08:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-09 12:08:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions. [2024-11-09 12:08:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 12:08:24,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:24,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:24,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:08:24,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:24,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1007821026, now seen corresponding path program 1 times [2024-11-09 12:08:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136357634] [2024-11-09 12:08:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:08:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565816829] [2024-11-09 12:08:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:25,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:25,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:25,008 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-09 12:08:25,010 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-09 12:08:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:25,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:08:25,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:08:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:25,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:08:25,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:25,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136357634] [2024-11-09 12:08:25,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:08:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565816829] [2024-11-09 12:08:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565816829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:08:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187175083] [2024-11-09 12:08:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:25,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:25,241 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 12:08:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:25,699 INFO L93 Difference]: Finished difference Result 426 states and 440 transitions. [2024-11-09 12:08:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:08:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 62 [2024-11-09 12:08:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:25,702 INFO L225 Difference]: With dead ends: 426 [2024-11-09 12:08:25,702 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 12:08:25,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-09 12:08:25,704 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 113 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:25,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:08:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 12:08:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 354. [2024-11-09 12:08:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 347 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:08:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions. [2024-11-09 12:08:25,720 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 62 [2024-11-09 12:08:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:25,720 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions. [2024-11-09 12:08:25,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 12:08:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions. [2024-11-09 12:08:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 12:08:25,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:25,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:25,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:08:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:25,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -809386143, now seen corresponding path program 1 times [2024-11-09 12:08:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144365008] [2024-11-09 12:08:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:08:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:26,030 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-09 12:08:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144365008] [2024-11-09 12:08:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144365008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:08:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218819267] [2024-11-09 12:08:26,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:26,035 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-09 12:08:30,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:08:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:30,127 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions. [2024-11-09 12:08:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:08:30,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-09 12:08:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:30,129 INFO L225 Difference]: With dead ends: 355 [2024-11-09 12:08:30,130 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 12:08:30,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:30,131 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 57 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:30,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 338 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 12:08:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 12:08:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-09 12:08:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.348148148148148) internal successors, (364), 347 states have internal predecessors, (364), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:08:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2024-11-09 12:08:30,142 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 69 [2024-11-09 12:08:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:30,142 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2024-11-09 12:08:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-09 12:08:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2024-11-09 12:08:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 12:08:30,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:30,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:30,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 12:08:30,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:30,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash 678833514, now seen corresponding path program 1 times [2024-11-09 12:08:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:30,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120169525] [2024-11-09 12:08:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:08:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120169525] [2024-11-09 12:08:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120169525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:30,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:30,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:08:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625118129] [2024-11-09 12:08:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:30,230 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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-09 12:08:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:30,530 INFO L93 Difference]: Finished difference Result 355 states and 374 transitions. [2024-11-09 12:08:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:08:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 70 [2024-11-09 12:08:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:30,532 INFO L225 Difference]: With dead ends: 355 [2024-11-09 12:08:30,533 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 12:08:30,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:08:30,534 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:30,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 347 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:08:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 12:08:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-09 12:08:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3444444444444446) internal successors, (363), 347 states have internal predecessors, (363), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:08:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 373 transitions. [2024-11-09 12:08:30,544 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 373 transitions. Word has length 70 [2024-11-09 12:08:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:30,545 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 373 transitions. [2024-11-09 12:08:30,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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-09 12:08:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 373 transitions. [2024-11-09 12:08:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:08:30,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:30,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:30,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 12:08:30,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:30,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1871737532, now seen corresponding path program 1 times [2024-11-09 12:08:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553046141] [2024-11-09 12:08:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:08:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553046141] [2024-11-09 12:08:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553046141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:08:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:08:30,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:08:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647687275] [2024-11-09 12:08:30,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:30,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:08:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:30,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:08:30,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:08:30,673 INFO L87 Difference]: Start difference. First operand 354 states and 373 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:08:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:30,725 INFO L93 Difference]: Finished difference Result 484 states and 508 transitions. [2024-11-09 12:08:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:08:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2024-11-09 12:08:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:30,728 INFO L225 Difference]: With dead ends: 484 [2024-11-09 12:08:30,728 INFO L226 Difference]: Without dead ends: 483 [2024-11-09 12:08:30,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:08:30,728 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 136 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:30,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 893 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:08:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-09 12:08:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 443. [2024-11-09 12:08:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 435 states have internal predecessors, (483), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:08:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 497 transitions. [2024-11-09 12:08:30,741 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 497 transitions. Word has length 73 [2024-11-09 12:08:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:30,742 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 497 transitions. [2024-11-09 12:08:30,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:08:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 497 transitions. [2024-11-09 12:08:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 12:08:30,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:30,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 12:08:30,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 12:08:30,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:30,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1637859655, now seen corresponding path program 1 times [2024-11-09 12:08:30,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:30,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496020731] [2024-11-09 12:08:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:08:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139295101] [2024-11-09 12:08:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:30,771 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-09 12:08:30,773 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-09 12:08:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:30,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:08:30,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:08:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:31,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:08:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496020731] [2024-11-09 12:08:31,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:08:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139295101] [2024-11-09 12:08:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139295101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:08:31,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:08:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-09 12:08:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120188392] [2024-11-09 12:08:31,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:08:31,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:08:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:08:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:08:31,503 INFO L87 Difference]: Start difference. First operand 443 states and 497 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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-09 12:08:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:32,889 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2024-11-09 12:08:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 12:08:32,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-09 12:08:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:32,894 INFO L225 Difference]: With dead ends: 467 [2024-11-09 12:08:32,894 INFO L226 Difference]: Without dead ends: 458 [2024-11-09 12:08:32,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:08:32,895 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 418 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:32,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 265 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 12:08:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-09 12:08:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2024-11-09 12:08:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 364 states have (on average 1.3186813186813187) internal successors, (480), 439 states have internal predecessors, (480), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:08:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions. [2024-11-09 12:08:32,914 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 113 [2024-11-09 12:08:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:32,914 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions. [2024-11-09 12:08:32,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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-09 12:08:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions. [2024-11-09 12:08:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 12:08:32,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:32,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 12:08:32,934 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-09 12:08:33,117 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,SelfDestructingSolverStorable11 [2024-11-09 12:08:33,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2025106249, now seen corresponding path program 1 times [2024-11-09 12:08:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:33,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031845463] [2024-11-09 12:08:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:08:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725934571] [2024-11-09 12:08:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:33,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:33,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:33,149 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-09 12:08:33,151 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-09 12:08:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:33,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:08:33,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:08:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:08:33,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:08:33,994 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-09 12:08:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031845463] [2024-11-09 12:08:33,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:08:33,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725934571] [2024-11-09 12:08:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725934571] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 12:08:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:08:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 12:08:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729419815] [2024-11-09 12:08:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:08:33,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:08:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:08:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:08:33,997 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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-09 12:08:41,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:08:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:44,856 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions. [2024-11-09 12:08:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:08:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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 115 [2024-11-09 12:08:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:44,861 INFO L225 Difference]: With dead ends: 447 [2024-11-09 12:08:44,861 INFO L226 Difference]: Without dead ends: 445 [2024-11-09 12:08:44,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:08:44,862 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:44,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2024-11-09 12:08:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-09 12:08:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-11-09 12:08:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 437 states have internal predecessors, (474), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:08:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 488 transitions. [2024-11-09 12:08:44,881 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 488 transitions. Word has length 115 [2024-11-09 12:08:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:44,881 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 488 transitions. [2024-11-09 12:08:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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-09 12:08:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 488 transitions. [2024-11-09 12:08:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 12:08:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:44,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:44,902 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-09 12:08:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:45,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1716314514, now seen corresponding path program 1 times [2024-11-09 12:08:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573807076] [2024-11-09 12:08:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:08:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614025750] [2024-11-09 12:08:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:45,127 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-09 12:08:45,128 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-09 12:08:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:45,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:08:45,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:08:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:08:45,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:08:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573807076] [2024-11-09 12:08:45,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:08:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614025750] [2024-11-09 12:08:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614025750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:08:45,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:08:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-09 12:08:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704124548] [2024-11-09 12:08:45,860 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 12:08:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:08:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:08:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:08:45,862 INFO L87 Difference]: Start difference. First operand 445 states and 488 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-09 12:08:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:08:46,340 INFO L93 Difference]: Finished difference Result 452 states and 497 transitions. [2024-11-09 12:08:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:08:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-09 12:08:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:08:46,342 INFO L225 Difference]: With dead ends: 452 [2024-11-09 12:08:46,342 INFO L226 Difference]: Without dead ends: 431 [2024-11-09 12:08:46,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:08:46,344 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:08:46,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:08:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-09 12:08:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2024-11-09 12:08:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 357 states have (on average 1.2128851540616246) internal successors, (433), 409 states have internal predecessors, (433), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:08:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 447 transitions. [2024-11-09 12:08:46,363 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 447 transitions. Word has length 122 [2024-11-09 12:08:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:08:46,363 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 447 transitions. [2024-11-09 12:08:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-09 12:08:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 447 transitions. [2024-11-09 12:08:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 12:08:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:08:46,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:08:46,382 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-09 12:08:46,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:46,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-11-09 12:08:46,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:08:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1666142645, now seen corresponding path program 1 times [2024-11-09 12:08:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:08:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071890110] [2024-11-09 12:08:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:08:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:08:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162511464] [2024-11-09 12:08:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:08:46,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:08:46,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:08:46,604 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-09 12:08:46,613 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-09 12:08:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:08:46,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 12:08:46,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:08:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:08:47,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:08:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:08:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:08:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071890110] [2024-11-09 12:08:48,552 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:08:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162511464] [2024-11-09 12:08:48,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162511464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:08:48,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:08:48,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 12:08:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837705766] [2024-11-09 12:08:48,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:08:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:08:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:08:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:08:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:08:48,555 INFO L87 Difference]: Start difference. First operand 417 states and 447 transitions. Second operand has 10 states, 9 states have (on average 25.333333333333332) internal successors, (228), 10 states have internal predecessors, (228), 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-09 12:08:53,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:08:56,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:00,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:04,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:08,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:12,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:16,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:20,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:24,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:29,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:33,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:37,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:41,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:44,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:49,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:53,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:57,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []