./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/eca-rers2012/Problem01_label41.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 91ebea43abc6271e81b3eed447826b716b76bbe82349fcd855bbd6d5636a25a9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:27:03,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:27:03,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:27:03,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:27:03,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:27:03,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:27:03,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:27:03,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:27:03,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:27:03,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:27:03,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:27:03,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:27:03,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:27:03,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:27:03,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:27:03,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:27:03,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:27:03,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:27:03,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:27:03,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:27:03,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:27:03,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:27:03,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:27:03,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:27:03,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:27:03,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:27:03,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:27:03,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:03,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:27:03,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:27:03,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:27:03,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:27:03,474 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 -> 91ebea43abc6271e81b3eed447826b716b76bbe82349fcd855bbd6d5636a25a9 [2024-11-08 10:27:03,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:27:03,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:27:03,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:27:03,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:27:03,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:27:03,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label41.c [2024-11-08 10:27:04,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:27:05,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:27:05,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label41.c [2024-11-08 10:27:05,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1fbaf358/71c0dc48b95147c491bbc618d9f037b7/FLAG64a1a98c1 [2024-11-08 10:27:05,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1fbaf358/71c0dc48b95147c491bbc618d9f037b7 [2024-11-08 10:27:05,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:27:05,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:27:05,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:05,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:27:05,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:27:05,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4b2b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05, skipping insertion in model container [2024-11-08 10:27:05,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:27:05,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/Problem01_label41.c[16127,16140] [2024-11-08 10:27:05,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:05,562 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:27:05,616 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/Problem01_label41.c[16127,16140] [2024-11-08 10:27:05,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:05,643 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:27:05,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05 WrapperNode [2024-11-08 10:27:05,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:05,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:05,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:27:05,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:27:05,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,703 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-08 10:27:05,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:05,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:27:05,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:27:05,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:27:05,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,743 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-08 10:27:05,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:27:05,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:27:05,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:27:05,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:27:05,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (1/1) ... [2024-11-08 10:27:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:05,818 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-08 10:27:05,825 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-08 10:27:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:27:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:27:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:27:05,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:27:05,933 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:27:05,935 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:27:06,787 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 10:27:06,787 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:27:06,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:27:06,810 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:27:06,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:06 BoogieIcfgContainer [2024-11-08 10:27:06,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:27:06,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:27:06,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:27:06,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:27:06,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:05" (1/3) ... [2024-11-08 10:27:06,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317cc207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:06, skipping insertion in model container [2024-11-08 10:27:06,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:05" (2/3) ... [2024-11-08 10:27:06,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317cc207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:06, skipping insertion in model container [2024-11-08 10:27:06,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:06" (3/3) ... [2024-11-08 10:27:06,819 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label41.c [2024-11-08 10:27:06,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:27:06,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:27:06,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:27:06,904 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;@28ac6d55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:27:06,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:27:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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-08 10:27:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 10:27:06,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:06,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:06,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:06,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash 867355110, now seen corresponding path program 1 times [2024-11-08 10:27:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:06,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795529260] [2024-11-08 10:27:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:07,340 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-08 10:27:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795529260] [2024-11-08 10:27:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795529260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973094302] [2024-11-08 10:27:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:07,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:07,374 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-08 10:27:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:07,985 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-08 10:27:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2024-11-08 10:27:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:07,997 INFO L225 Difference]: With dead ends: 528 [2024-11-08 10:27:07,997 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 10:27:08,001 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-08 10:27:08,003 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 103 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:08,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:27:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 10:27:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-08 10:27:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 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-08 10:27:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions. [2024-11-08 10:27:08,051 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 85 [2024-11-08 10:27:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:08,052 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions. [2024-11-08 10:27:08,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-08 10:27:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions. [2024-11-08 10:27:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 10:27:08,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:08,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:27:08,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1655802317, now seen corresponding path program 1 times [2024-11-08 10:27:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803162568] [2024-11-08 10:27:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803162568] [2024-11-08 10:27:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803162568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8902817] [2024-11-08 10:27:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:08,138 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-08 10:27:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:08,490 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions. [2024-11-08 10:27:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:08,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-11-08 10:27:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:08,493 INFO L225 Difference]: With dead ends: 792 [2024-11-08 10:27:08,493 INFO L226 Difference]: Without dead ends: 528 [2024-11-08 10:27:08,494 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-08 10:27:08,495 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:08,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 38 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-08 10:27:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-08 10:27:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3776091081593929) internal successors, (726), 527 states have internal predecessors, (726), 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-08 10:27:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 726 transitions. [2024-11-08 10:27:08,521 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 726 transitions. Word has length 91 [2024-11-08 10:27:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:08,522 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 726 transitions. [2024-11-08 10:27:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-08 10:27:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 726 transitions. [2024-11-08 10:27:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 10:27:08,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:08,526 INFO L215 NwaCegarLoop]: trace histogram [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-08 10:27:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:27:08,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1589093430, now seen corresponding path program 1 times [2024-11-08 10:27:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014292185] [2024-11-08 10:27:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014292185] [2024-11-08 10:27:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014292185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577405554] [2024-11-08 10:27:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:08,697 INFO L87 Difference]: Start difference. First operand 528 states and 726 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-08 10:27:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:09,027 INFO L93 Difference]: Finished difference Result 1578 states and 2173 transitions. [2024-11-08 10:27:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-11-08 10:27:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:09,030 INFO L225 Difference]: With dead ends: 1578 [2024-11-08 10:27:09,030 INFO L226 Difference]: Without dead ends: 1052 [2024-11-08 10:27:09,032 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-08 10:27:09,032 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:09,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 37 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-08 10:27:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2024-11-08 10:27:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.3092293054234063) internal successors, (1376), 1051 states have internal predecessors, (1376), 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-08 10:27:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1376 transitions. [2024-11-08 10:27:09,057 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1376 transitions. Word has length 106 [2024-11-08 10:27:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:09,057 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1376 transitions. [2024-11-08 10:27:09,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-08 10:27:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1376 transitions. [2024-11-08 10:27:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 10:27:09,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:09,063 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:09,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:27:09,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1915873080, now seen corresponding path program 1 times [2024-11-08 10:27:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:09,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965805804] [2024-11-08 10:27:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:27:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965805804] [2024-11-08 10:27:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965805804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:09,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:09,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965772436] [2024-11-08 10:27:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:09,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:09,189 INFO L87 Difference]: Start difference. First operand 1052 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 10:27:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:09,546 INFO L93 Difference]: Finished difference Result 2495 states and 3288 transitions. [2024-11-08 10:27:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 119 [2024-11-08 10:27:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:09,552 INFO L225 Difference]: With dead ends: 2495 [2024-11-08 10:27:09,552 INFO L226 Difference]: Without dead ends: 1445 [2024-11-08 10:27:09,556 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-08 10:27:09,558 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:09,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 30 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-08 10:27:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1052. [2024-11-08 10:27:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.3044719314938154) internal successors, (1371), 1051 states have internal predecessors, (1371), 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-08 10:27:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1371 transitions. [2024-11-08 10:27:09,590 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1371 transitions. Word has length 119 [2024-11-08 10:27:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1371 transitions. [2024-11-08 10:27:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 10:27:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1371 transitions. [2024-11-08 10:27:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 10:27:09,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:09,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:09,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:27:09,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:09,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2700462, now seen corresponding path program 1 times [2024-11-08 10:27:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:09,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623087336] [2024-11-08 10:27:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 10:27:09,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623087336] [2024-11-08 10:27:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623087336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647470144] [2024-11-08 10:27:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:09,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:09,728 INFO L87 Difference]: Start difference. First operand 1052 states and 1371 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-08 10:27:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:10,051 INFO L93 Difference]: Finished difference Result 2626 states and 3390 transitions. [2024-11-08 10:27:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 123 [2024-11-08 10:27:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:10,056 INFO L225 Difference]: With dead ends: 2626 [2024-11-08 10:27:10,056 INFO L226 Difference]: Without dead ends: 1576 [2024-11-08 10:27:10,057 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-08 10:27:10,058 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:10,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 54 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-08 10:27:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2024-11-08 10:27:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2711348057882712) internal successors, (1669), 1313 states have internal predecessors, (1669), 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-08 10:27:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1669 transitions. [2024-11-08 10:27:10,080 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1669 transitions. Word has length 123 [2024-11-08 10:27:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1669 transitions. [2024-11-08 10:27:10,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-08 10:27:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1669 transitions. [2024-11-08 10:27:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 10:27:10,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:10,082 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 10:27:10,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:27:10,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:10,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1985753384, now seen corresponding path program 1 times [2024-11-08 10:27:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069422971] [2024-11-08 10:27:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 10:27:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069422971] [2024-11-08 10:27:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069422971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692449953] [2024-11-08 10:27:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:10,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:10,165 INFO L87 Difference]: Start difference. First operand 1314 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-08 10:27:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:10,495 INFO L93 Difference]: Finished difference Result 3281 states and 4117 transitions. [2024-11-08 10:27:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 136 [2024-11-08 10:27:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:10,502 INFO L225 Difference]: With dead ends: 3281 [2024-11-08 10:27:10,502 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:27:10,504 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-08 10:27:10,505 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:10,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 23 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:27:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2024-11-08 10:27:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.245079365079365) internal successors, (1961), 1575 states have internal predecessors, (1961), 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-08 10:27:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1961 transitions. [2024-11-08 10:27:10,541 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1961 transitions. Word has length 136 [2024-11-08 10:27:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1961 transitions. [2024-11-08 10:27:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-08 10:27:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1961 transitions. [2024-11-08 10:27:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 10:27:10,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:10,544 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:10,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:27:10,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:10,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1308978639, now seen corresponding path program 1 times [2024-11-08 10:27:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:10,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356841167] [2024-11-08 10:27:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 10:27:10,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:10,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356841167] [2024-11-08 10:27:10,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356841167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:10,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51985076] [2024-11-08 10:27:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:10,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:10,683 INFO L87 Difference]: Start difference. First operand 1576 states and 1961 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-08 10:27:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:11,003 INFO L93 Difference]: Finished difference Result 3412 states and 4260 transitions. [2024-11-08 10:27:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 138 [2024-11-08 10:27:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:11,009 INFO L225 Difference]: With dead ends: 3412 [2024-11-08 10:27:11,009 INFO L226 Difference]: Without dead ends: 1838 [2024-11-08 10:27:11,011 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-08 10:27:11,013 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:11,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-08 10:27:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-08 10:27:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2368112543962486) internal successors, (2110), 1706 states have internal predecessors, (2110), 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-08 10:27:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2024-11-08 10:27:11,043 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 138 [2024-11-08 10:27:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2024-11-08 10:27:11,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-08 10:27:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2024-11-08 10:27:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 10:27:11,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:11,047 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:27:11,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 931813, now seen corresponding path program 1 times [2024-11-08 10:27:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467876291] [2024-11-08 10:27:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 10:27:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467876291] [2024-11-08 10:27:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467876291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341714661] [2024-11-08 10:27:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:11,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:11,234 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-08 10:27:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:11,567 INFO L93 Difference]: Finished difference Result 3674 states and 4504 transitions. [2024-11-08 10:27:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 154 [2024-11-08 10:27:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:11,572 INFO L225 Difference]: With dead ends: 3674 [2024-11-08 10:27:11,572 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:27:11,574 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-08 10:27:11,575 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:11,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 211 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:27:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2024-11-08 10:27:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.2199237887860643) internal successors, (2241), 1837 states have internal predecessors, (2241), 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-08 10:27:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2241 transitions. [2024-11-08 10:27:11,605 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2241 transitions. Word has length 154 [2024-11-08 10:27:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:11,605 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2241 transitions. [2024-11-08 10:27:11,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-08 10:27:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2241 transitions. [2024-11-08 10:27:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 10:27:11,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:11,608 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:27:11,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 763947048, now seen corresponding path program 1 times [2024-11-08 10:27:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428857233] [2024-11-08 10:27:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 10:27:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428857233] [2024-11-08 10:27:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428857233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:11,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:27:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412442298] [2024-11-08 10:27:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:11,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:27:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:27:11,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:11,784 INFO L87 Difference]: Start difference. First operand 1838 states and 2241 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-08 10:27:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:12,281 INFO L93 Difference]: Finished difference Result 4591 states and 5560 transitions. [2024-11-08 10:27:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:27:12,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 168 [2024-11-08 10:27:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:12,291 INFO L225 Difference]: With dead ends: 4591 [2024-11-08 10:27:12,292 INFO L226 Difference]: Without dead ends: 2624 [2024-11-08 10:27:12,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 10:27:12,295 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 249 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:12,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 38 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:27:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-08 10:27:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2231. [2024-11-08 10:27:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1896860986547084) internal successors, (2653), 2230 states have internal predecessors, (2653), 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-08 10:27:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2653 transitions. [2024-11-08 10:27:12,328 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2653 transitions. Word has length 168 [2024-11-08 10:27:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2653 transitions. [2024-11-08 10:27:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-08 10:27:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2653 transitions. [2024-11-08 10:27:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 10:27:12,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:12,332 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:12,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:27:12,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:12,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash 800831842, now seen corresponding path program 1 times [2024-11-08 10:27:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264462580] [2024-11-08 10:27:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 10:27:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264462580] [2024-11-08 10:27:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264462580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:27:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002663950] [2024-11-08 10:27:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:12,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:27:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:27:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:12,471 INFO L87 Difference]: Start difference. First operand 2231 states and 2653 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-08 10:27:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:12,915 INFO L93 Difference]: Finished difference Result 4853 states and 5749 transitions. [2024-11-08 10:27:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:27:12,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 171 [2024-11-08 10:27:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:12,922 INFO L225 Difference]: With dead ends: 4853 [2024-11-08 10:27:12,922 INFO L226 Difference]: Without dead ends: 2624 [2024-11-08 10:27:12,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 10:27:12,925 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 349 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:12,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 34 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-08 10:27:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2231. [2024-11-08 10:27:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1896860986547084) internal successors, (2653), 2230 states have internal predecessors, (2653), 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-08 10:27:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2653 transitions. [2024-11-08 10:27:12,958 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2653 transitions. Word has length 171 [2024-11-08 10:27:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:12,958 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2653 transitions. [2024-11-08 10:27:12,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-08 10:27:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2653 transitions. [2024-11-08 10:27:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 10:27:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:12,962 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:27:12,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 451757381, now seen corresponding path program 1 times [2024-11-08 10:27:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711619956] [2024-11-08 10:27:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 10:27:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711619956] [2024-11-08 10:27:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711619956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:27:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50322661] [2024-11-08 10:27:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:27:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:13,187 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-08 10:27:13,189 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-08 10:27:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:13,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:27:13,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:27:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 10:27:13,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:27:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50322661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:13,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:27:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:27:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116463477] [2024-11-08 10:27:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:13,400 INFO L87 Difference]: Start difference. First operand 2231 states and 2653 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-08 10:27:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:13,701 INFO L93 Difference]: Finished difference Result 2626 states and 3084 transitions. [2024-11-08 10:27:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 185 [2024-11-08 10:27:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:13,708 INFO L225 Difference]: With dead ends: 2626 [2024-11-08 10:27:13,708 INFO L226 Difference]: Without dead ends: 2624 [2024-11-08 10:27:13,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:13,709 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 71 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:13,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 30 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-08 10:27:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2100. [2024-11-08 10:27:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1815150071462601) internal successors, (2480), 2099 states have internal predecessors, (2480), 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-08 10:27:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2480 transitions. [2024-11-08 10:27:13,737 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2480 transitions. Word has length 185 [2024-11-08 10:27:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2480 transitions. [2024-11-08 10:27:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-08 10:27:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2480 transitions. [2024-11-08 10:27:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 10:27:13,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:13,741 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:13,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:27:13,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 10:27:13,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:13,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1669631844, now seen corresponding path program 1 times [2024-11-08 10:27:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350487591] [2024-11-08 10:27:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 63 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350487591] [2024-11-08 10:27:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350487591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:27:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049120379] [2024-11-08 10:27:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:14,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:27:14,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:14,301 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-08 10:27:14,301 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-08 10:27:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:14,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:27:14,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:27:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 10:27:14,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:27:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049120379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:27:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 10:27:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314911745] [2024-11-08 10:27:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:27:14,565 INFO L87 Difference]: Start difference. First operand 2100 states and 2480 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-08 10:27:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:14,903 INFO L93 Difference]: Finished difference Result 4591 states and 5411 transitions. [2024-11-08 10:27:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:14,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 189 [2024-11-08 10:27:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:14,910 INFO L225 Difference]: With dead ends: 4591 [2024-11-08 10:27:14,910 INFO L226 Difference]: Without dead ends: 2493 [2024-11-08 10:27:14,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:27:14,914 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:14,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2024-11-08 10:27:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2100. [2024-11-08 10:27:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1557884707003334) internal successors, (2426), 2099 states have internal predecessors, (2426), 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-08 10:27:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2426 transitions. [2024-11-08 10:27:14,945 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2426 transitions. Word has length 189 [2024-11-08 10:27:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:14,946 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2426 transitions. [2024-11-08 10:27:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-08 10:27:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2426 transitions. [2024-11-08 10:27:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 10:27:14,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:14,949 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:27:14,966 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-08 10:27:15,149 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-08 10:27:15,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:15,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 185682996, now seen corresponding path program 1 times [2024-11-08 10:27:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:15,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707817955] [2024-11-08 10:27:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 125 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 10:27:15,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707817955] [2024-11-08 10:27:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707817955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:27:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853714960] [2024-11-08 10:27:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:15,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:27:15,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:15,349 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-08 10:27:15,350 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-08 10:27:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:15,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:27:15,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:27:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 10:27:15,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:27:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853714960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:27:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:27:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89887485] [2024-11-08 10:27:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:15,578 INFO L87 Difference]: Start difference. First operand 2100 states and 2426 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-08 10:27:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:15,885 INFO L93 Difference]: Finished difference Result 3803 states and 4396 transitions. [2024-11-08 10:27:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:15,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 191 [2024-11-08 10:27:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:15,886 INFO L225 Difference]: With dead ends: 3803 [2024-11-08 10:27:15,886 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:27:15,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:15,889 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:15,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 189 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:27:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:27:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:27:15,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2024-11-08 10:27:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:15,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:27:15,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-08 10:27:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:27:15,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:27:15,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:27:15,906 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-08 10:27:16,096 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-08 10:27:16,100 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:16,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:27:16,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:27:16,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:16 BoogieIcfgContainer [2024-11-08 10:27:16,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:27:16,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:27:16,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:27:16,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:27:16,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:06" (3/4) ... [2024-11-08 10:27:16,458 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:27:16,467 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:27:16,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:27:16,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:27:16,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:27:16,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:27:16,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:27:16,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:27:16,582 INFO L158 Benchmark]: Toolchain (without parser) took 11366.45ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 155.4MB in the beginning and 129.3MB in the end (delta: 26.1MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,583 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:16,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.21ms. Allocated memory is still 190.8MB. Free memory was 155.4MB in the beginning and 125.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.91ms. Allocated memory is still 190.8MB. Free memory was 125.2MB in the beginning and 120.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,584 INFO L158 Benchmark]: Boogie Preprocessor took 82.00ms. Allocated memory is still 190.8MB. Free memory was 120.0MB in the beginning and 113.6MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,584 INFO L158 Benchmark]: RCFGBuilder took 1023.87ms. Allocated memory is still 190.8MB. Free memory was 113.6MB in the beginning and 130.4MB in the end (delta: -16.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,584 INFO L158 Benchmark]: TraceAbstraction took 9643.02ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 130.4MB in the beginning and 141.9MB in the end (delta: -11.5MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,585 INFO L158 Benchmark]: Witness Printer took 126.65ms. Allocated memory is still 369.1MB. Free memory was 141.9MB in the beginning and 129.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:16,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.21ms. Allocated memory is still 190.8MB. Free memory was 155.4MB in the beginning and 125.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.91ms. Allocated memory is still 190.8MB. Free memory was 125.2MB in the beginning and 120.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.00ms. Allocated memory is still 190.8MB. Free memory was 120.0MB in the beginning and 113.6MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1023.87ms. Allocated memory is still 190.8MB. Free memory was 113.6MB in the beginning and 130.4MB in the end (delta: -16.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9643.02ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 130.4MB in the beginning and 141.9MB in the end (delta: -11.5MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Witness Printer took 126.65ms. Allocated memory is still 369.1MB. Free memory was 141.9MB in the beginning and 129.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 441]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1819 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1819 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 766 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4855 IncrementalHoareTripleChecker+Invalid, 5621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 766 mSolverCounterUnsat, 902 mSDtfsCounter, 4855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 3013 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2421 NumberOfCodeBlocks, 2421 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2405 ConstructedInterpolants, 0 QuantifiedInterpolants, 8098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1088 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1586/1700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((((a7 != 1) && (a17 <= 0)) && (14 <= a8)) && (a21 == 1)) || ((((a17 <= 0) && (14 <= a8)) && (a21 == 1)) && (a20 == 1))) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || ((((a7 != 1) && (a17 <= 0)) && (a21 == 1)) && (a16 <= 4))) || (((a21 <= 0) && (a17 <= 0)) && (a20 == 1))) || ((a21 <= 0) && (a16 <= 5))) || (((a21 <= 0) && (a17 == 1)) && (a20 == 1))) || (((((5 <= a16) && (a7 != 1)) && (14 <= a8)) && (a21 == 1)) && (a17 == 1))) || ((((a17 <= 0) && (14 <= a8)) && (a21 == 1)) && (a16 <= 5))) || ((((a7 != 1) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:27:16,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE