./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/eca-rers2012/Problem10_label58.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efcca11f97cbed882a9ba52f5d161febd43a513474cce653ec22c65b3cce28d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:20:33,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:20:33,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:20:33,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:20:33,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:20:33,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:20:33,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:20:33,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:20:33,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:20:33,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:20:33,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:20:33,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:20:33,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:20:33,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:20:33,815 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:20:33,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:20:33,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:20:33,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:20:33,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:20:33,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:20:33,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:20:33,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:20:33,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:20:33,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:20:33,819 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:20:33,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:20:33,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:20:33,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:20:33,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:20:33,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:20:33,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:20:33,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:20:33,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:33,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:20:33,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:20:33,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:20:33,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:20:33,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:20:33,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:20:33,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:20:33,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:20:33,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:20:33,825 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 ! call(reach_error())) ) 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 -> efcca11f97cbed882a9ba52f5d161febd43a513474cce653ec22c65b3cce28d1 [2024-11-18 10:20:34,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:20:34,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:20:34,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:20:34,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:20:34,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:20:34,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2024-11-18 10:20:35,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:20:35,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:20:35,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2024-11-18 10:20:35,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b109d1b/4a309cdecc2440efb473a942226f4a72/FLAG57c60855b [2024-11-18 10:20:36,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b109d1b/4a309cdecc2440efb473a942226f4a72 [2024-11-18 10:20:36,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:20:36,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:20:36,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:36,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:20:36,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:20:36,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748a18fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36, skipping insertion in model container [2024-11-18 10:20:36,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:20:36,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2024-11-18 10:20:36,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:36,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:20:36,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2024-11-18 10:20:36,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:36,821 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:20:36,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36 WrapperNode [2024-11-18 10:20:36,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:36,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:36,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:20:36,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:20:36,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,933 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-18 10:20:36,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:36,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:20:36,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:20:36,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:20:36,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,986 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-18 10:20:36,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:36,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:20:37,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:20:37,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:20:37,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:20:37,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (1/1) ... [2024-11-18 10:20:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:37,091 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-18 10:20:37,096 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-18 10:20:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:20:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:20:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:20:37,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:20:37,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:20:37,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:20:38,406 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 10:20:38,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:20:38,427 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:20:38,429 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:20:38,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:38 BoogieIcfgContainer [2024-11-18 10:20:38,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:20:38,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:20:38,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:20:38,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:20:38,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:20:36" (1/3) ... [2024-11-18 10:20:38,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c996ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:38, skipping insertion in model container [2024-11-18 10:20:38,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:36" (2/3) ... [2024-11-18 10:20:38,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c996ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:38, skipping insertion in model container [2024-11-18 10:20:38,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:38" (3/3) ... [2024-11-18 10:20:38,440 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2024-11-18 10:20:38,459 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:20:38,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:20:38,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:20:38,547 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;@10a3a0a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:20:38,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:20:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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-18 10:20:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 10:20:38,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:38,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:38,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -461255479, now seen corresponding path program 1 times [2024-11-18 10:20:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300881384] [2024-11-18 10:20:38,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:38,793 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-18 10:20:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300881384] [2024-11-18 10:20:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300881384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:38,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323471855] [2024-11-18 10:20:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:38,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:38,830 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:20:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:39,638 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-18 10:20:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 10:20:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:39,652 INFO L225 Difference]: With dead ends: 552 [2024-11-18 10:20:39,652 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 10:20:39,655 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-18 10:20:39,658 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:39,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:20:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 10:20:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-18 10:20:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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-18 10:20:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-18 10:20:39,702 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 13 [2024-11-18 10:20:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:39,703 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-18 10:20:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:20:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-18 10:20:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 10:20:39,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:39,707 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:20:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:20:39,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:39,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1757812319, now seen corresponding path program 1 times [2024-11-18 10:20:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559247403] [2024-11-18 10:20:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:40,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559247403] [2024-11-18 10:20:40,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559247403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:40,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143598493] [2024-11-18 10:20:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:40,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:40,207 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-18 10:20:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:40,681 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-18 10:20:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:40,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82 [2024-11-18 10:20:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:40,684 INFO L225 Difference]: With dead ends: 701 [2024-11-18 10:20:40,684 INFO L226 Difference]: Without dead ends: 421 [2024-11-18 10:20:40,685 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-18 10:20:40,686 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:40,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-18 10:20:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-18 10:20:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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-18 10:20:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-18 10:20:40,721 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 82 [2024-11-18 10:20:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:40,722 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-18 10:20:40,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-18 10:20:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-18 10:20:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-18 10:20:40,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:40,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:20:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:20:40,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1580554992, now seen corresponding path program 1 times [2024-11-18 10:20:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469762339] [2024-11-18 10:20:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469762339] [2024-11-18 10:20:40,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469762339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:40,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:40,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:40,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522187840] [2024-11-18 10:20:40,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:40,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:40,919 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-18 10:20:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:41,407 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2024-11-18 10:20:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:41,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2024-11-18 10:20:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:41,412 INFO L225 Difference]: With dead ends: 1118 [2024-11-18 10:20:41,412 INFO L226 Difference]: Without dead ends: 838 [2024-11-18 10:20:41,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 10:20:41,417 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:41,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 226 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-18 10:20:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-18 10:20:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.330945558739255) internal successors, (929), 698 states have internal predecessors, (929), 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-18 10:20:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 929 transitions. [2024-11-18 10:20:41,460 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 929 transitions. Word has length 88 [2024-11-18 10:20:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 929 transitions. [2024-11-18 10:20:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-18 10:20:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 929 transitions. [2024-11-18 10:20:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 10:20:41,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:41,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:20:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:20:41,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:41,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash -913886526, now seen corresponding path program 1 times [2024-11-18 10:20:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979622939] [2024-11-18 10:20:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979622939] [2024-11-18 10:20:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979622939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422047791] [2024-11-18 10:20:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:41,637 INFO L87 Difference]: Start difference. First operand 699 states and 929 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 10:20:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:42,117 INFO L93 Difference]: Finished difference Result 1396 states and 1962 transitions. [2024-11-18 10:20:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2024-11-18 10:20:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:42,121 INFO L225 Difference]: With dead ends: 1396 [2024-11-18 10:20:42,121 INFO L226 Difference]: Without dead ends: 838 [2024-11-18 10:20:42,123 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-18 10:20:42,124 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:42,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:42,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-18 10:20:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-18 10:20:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3094555873925502) internal successors, (914), 698 states have internal predecessors, (914), 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-18 10:20:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2024-11-18 10:20:42,140 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 107 [2024-11-18 10:20:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:42,140 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2024-11-18 10:20:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 10:20:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2024-11-18 10:20:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-18 10:20:42,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:42,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:20:42,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -278006066, now seen corresponding path program 1 times [2024-11-18 10:20:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460816953] [2024-11-18 10:20:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-18 10:20:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460816953] [2024-11-18 10:20:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460816953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418693960] [2024-11-18 10:20:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:42,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:42,333 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-18 10:20:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:42,757 INFO L93 Difference]: Finished difference Result 1535 states and 2010 transitions. [2024-11-18 10:20:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 148 [2024-11-18 10:20:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:42,762 INFO L225 Difference]: With dead ends: 1535 [2024-11-18 10:20:42,763 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:20:42,764 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-18 10:20:42,766 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:20:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-18 10:20:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1905737704918034) internal successors, (1162), 976 states have internal predecessors, (1162), 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-18 10:20:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1162 transitions. [2024-11-18 10:20:42,792 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1162 transitions. Word has length 148 [2024-11-18 10:20:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:42,793 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1162 transitions. [2024-11-18 10:20:42,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-18 10:20:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1162 transitions. [2024-11-18 10:20:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-18 10:20:42,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:42,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:42,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:20:42,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1399253793, now seen corresponding path program 1 times [2024-11-18 10:20:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134953439] [2024-11-18 10:20:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134953439] [2024-11-18 10:20:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134953439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486494968] [2024-11-18 10:20:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:42,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:42,971 INFO L87 Difference]: Start difference. First operand 977 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-18 10:20:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:43,418 INFO L93 Difference]: Finished difference Result 2091 states and 2557 transitions. [2024-11-18 10:20:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 165 [2024-11-18 10:20:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:43,424 INFO L225 Difference]: With dead ends: 2091 [2024-11-18 10:20:43,424 INFO L226 Difference]: Without dead ends: 1255 [2024-11-18 10:20:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 10:20:43,426 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:43,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-18 10:20:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2024-11-18 10:20:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1757847533632286) internal successors, (1311), 1115 states have internal predecessors, (1311), 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-18 10:20:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1311 transitions. [2024-11-18 10:20:43,446 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1311 transitions. Word has length 165 [2024-11-18 10:20:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1311 transitions. [2024-11-18 10:20:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-18 10:20:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1311 transitions. [2024-11-18 10:20:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-18 10:20:43,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:43,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:20:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:20:43,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 143010852, now seen corresponding path program 1 times [2024-11-18 10:20:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665576143] [2024-11-18 10:20:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665576143] [2024-11-18 10:20:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665576143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 10:20:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053707997] [2024-11-18 10:20:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 10:20:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 10:20:43,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:20:43,923 INFO L87 Difference]: Start difference. First operand 1116 states and 1311 transitions. Second operand has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 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-18 10:20:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:44,473 INFO L93 Difference]: Finished difference Result 2146 states and 2531 transitions. [2024-11-18 10:20:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 10:20:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 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 225 [2024-11-18 10:20:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:44,478 INFO L225 Difference]: With dead ends: 2146 [2024-11-18 10:20:44,478 INFO L226 Difference]: Without dead ends: 1116 [2024-11-18 10:20:44,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:20:44,483 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:44,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-18 10:20:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-18 10:20:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 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-18 10:20:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-18 10:20:44,508 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 225 [2024-11-18 10:20:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-18 10:20:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 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-18 10:20:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-18 10:20:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-18 10:20:44,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:44,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:44,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:20:44,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2034481354, now seen corresponding path program 1 times [2024-11-18 10:20:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207881617] [2024-11-18 10:20:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 11 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:45,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207881617] [2024-11-18 10:20:45,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207881617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:20:45,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15702820] [2024-11-18 10:20:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:45,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:45,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:45,224 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-18 10:20:45,225 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-18 10:20:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:45,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 10:20:45,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:20:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 11 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:45,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 10:20:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15702820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 10:20:47,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 10:20:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-18 10:20:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631642979] [2024-11-18 10:20:47,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 10:20:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 10:20:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 10:20:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2024-11-18 10:20:47,041 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 9 states, 9 states have (on average 59.22222222222222) internal successors, (533), 8 states have internal predecessors, (533), 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-18 10:20:52,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:20:56,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:21:00,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:21:05,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:09,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:13,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:17,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:26,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:21:30,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:34,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:38,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:42,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:21:46,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:50,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:54,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 10:21:58,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:22:02,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:22:07,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-18 10:22:11,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1]