./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:16:25,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:16:25,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:16:25,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:16:25,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:16:25,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:16:25,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:16:25,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:16:25,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:16:25,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:16:25,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:16:25,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:16:25,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:16:25,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:16:25,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:16:25,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:16:25,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:16:25,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:16:25,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:16:25,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:16:25,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:16:25,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:16:25,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:16:25,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:16:25,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:16:25,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:16:25,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:16:25,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:16:25,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:16:25,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:16:25,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:16:25,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:16:25,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:25,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:16:25,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:16:25,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:16:25,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:16:25,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:16:25,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:16:25,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:16:25,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:16:25,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:16:25,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 [2024-10-10 23:16:25,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:16:26,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:16:26,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:16:26,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:16:26,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:16:26,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2024-10-10 23:16:27,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:16:28,125 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:16:28,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2024-10-10 23:16:28,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bce55fa37/a7c05eb231814fad9531ee0c43c2559b/FLAGf1e2a7414 [2024-10-10 23:16:28,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bce55fa37/a7c05eb231814fad9531ee0c43c2559b [2024-10-10 23:16:28,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:16:28,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:16:28,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:28,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:16:28,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:16:28,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c149f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28, skipping insertion in model container [2024-10-10 23:16:28,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:16:28,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2024-10-10 23:16:28,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:28,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:16:28,583 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2024-10-10 23:16:28,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:28,656 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:16:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28 WrapperNode [2024-10-10 23:16:28,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:28,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:28,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:16:28,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:16:28,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,722 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:16:28,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:28,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:16:28,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:16:28,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:16:28,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:16:28,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:16:28,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:16:28,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:16:28,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:16:28,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (1/1) ... [2024-10-10 23:16:28,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:28,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:16:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:16:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:16:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:16:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:16:28,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:16:28,921 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:16:28,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:16:29,690 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:16:29,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:16:29,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:16:29,734 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:16:29,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:29 BoogieIcfgContainer [2024-10-10 23:16:29,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:16:29,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:16:29,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:16:29,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:16:29,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:16:28" (1/3) ... [2024-10-10 23:16:29,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a9d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:29, skipping insertion in model container [2024-10-10 23:16:29,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:28" (2/3) ... [2024-10-10 23:16:29,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a9d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:29, skipping insertion in model container [2024-10-10 23:16:29,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:29" (3/3) ... [2024-10-10 23:16:29,742 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23.c [2024-10-10 23:16:29,755 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:16:29,755 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:16:29,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:16:29,814 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;@435ed737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:16:29,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:16:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:16:29,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:29,824 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] [2024-10-10 23:16:29,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 453659079, now seen corresponding path program 1 times [2024-10-10 23:16:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670975209] [2024-10-10 23:16:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:29,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:29,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670975209] [2024-10-10 23:16:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670975209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:29,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:29,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131027047] [2024-10-10 23:16:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:16:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:16:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:30,024 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:30,058 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:16:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:16:30,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 45 [2024-10-10 23:16:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:30,071 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:16:30,071 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:16:30,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:30,078 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:30,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:16:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:16:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:16:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:16:30,111 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 45 [2024-10-10 23:16:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:30,112 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:16:30,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:16:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:16:30,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:30,113 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] [2024-10-10 23:16:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:16:30,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1237186955, now seen corresponding path program 1 times [2024-10-10 23:16:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111244466] [2024-10-10 23:16:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111244466] [2024-10-10 23:16:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111244466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287159128] [2024-10-10 23:16:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:30,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:30,296 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:30,841 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-10 23:16:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:30,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 45 [2024-10-10 23:16:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:30,847 INFO L225 Difference]: With dead ends: 422 [2024-10-10 23:16:30,847 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:16:30,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:30,849 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:30,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:16:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:16:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-10 23:16:30,875 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 45 [2024-10-10 23:16:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:30,876 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-10 23:16:30,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-10 23:16:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-10 23:16:30,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:30,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:16:30,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -57112095, now seen corresponding path program 1 times [2024-10-10 23:16:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735314546] [2024-10-10 23:16:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735314546] [2024-10-10 23:16:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735314546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209036787] [2024-10-10 23:16:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:31,074 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:31,598 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-10 23:16:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2024-10-10 23:16:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:31,601 INFO L225 Difference]: With dead ends: 700 [2024-10-10 23:16:31,601 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:16:31,605 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-10-10 23:16:31,606 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:31,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 212 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:16:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:16:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.2529832935560858) internal successors, (525), 419 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2024-10-10 23:16:31,629 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 111 [2024-10-10 23:16:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:31,630 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2024-10-10 23:16:31,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2024-10-10 23:16:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-10 23:16:31,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:31,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:31,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:16:31,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:31,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash -719557250, now seen corresponding path program 1 times [2024-10-10 23:16:31,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:31,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856603931] [2024-10-10 23:16:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856603931] [2024-10-10 23:16:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856603931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188754981] [2024-10-10 23:16:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:31,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:31,888 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:32,243 INFO L93 Difference]: Finished difference Result 978 states and 1208 transitions. [2024-10-10 23:16:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2024-10-10 23:16:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:32,247 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:16:32,247 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:16:32,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:32,249 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:32,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:16:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:16:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:16:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2078853046594982) internal successors, (674), 558 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2024-10-10 23:16:32,263 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 118 [2024-10-10 23:16:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:32,263 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 674 transitions. [2024-10-10 23:16:32,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 674 transitions. [2024-10-10 23:16:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-10 23:16:32,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:32,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:32,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:16:32,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1808036999, now seen corresponding path program 1 times [2024-10-10 23:16:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074785106] [2024-10-10 23:16:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074785106] [2024-10-10 23:16:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074785106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773797763] [2024-10-10 23:16:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:32,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:32,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:16:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:32,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:32,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:32,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773797763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:32,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:16:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573521023] [2024-10-10 23:16:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:32,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:32,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:16:32,778 INFO L87 Difference]: Start difference. First operand 559 states and 674 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:33,201 INFO L93 Difference]: Finished difference Result 978 states and 1198 transitions. [2024-10-10 23:16:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2024-10-10 23:16:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:33,204 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:16:33,204 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:16:33,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:16:33,206 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:33,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:16:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 698. [2024-10-10 23:16:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2740315638450501) internal successors, (888), 697 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 888 transitions. [2024-10-10 23:16:33,216 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 888 transitions. Word has length 120 [2024-10-10 23:16:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:33,217 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 888 transitions. [2024-10-10 23:16:33,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 888 transitions. [2024-10-10 23:16:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-10 23:16:33,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:33,218 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:33,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:16:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:33,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:33,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1955061857, now seen corresponding path program 1 times [2024-10-10 23:16:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555173512] [2024-10-10 23:16:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555173512] [2024-10-10 23:16:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555173512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302909231] [2024-10-10 23:16:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:16:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:16:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:16:33,693 INFO L87 Difference]: Start difference. First operand 698 states and 888 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:34,224 INFO L93 Difference]: Finished difference Result 1256 states and 1626 transitions. [2024-10-10 23:16:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:16:34,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2024-10-10 23:16:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:34,227 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:16:34,227 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:16:34,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:16:34,228 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:34,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:16:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:16:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.266857962697274) internal successors, (883), 697 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 883 transitions. [2024-10-10 23:16:34,238 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 883 transitions. Word has length 163 [2024-10-10 23:16:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:34,239 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 883 transitions. [2024-10-10 23:16:34,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 883 transitions. [2024-10-10 23:16:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:16:34,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:34,241 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:16:34,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:16:34,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 527459719, now seen corresponding path program 1 times [2024-10-10 23:16:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:34,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529327737] [2024-10-10 23:16:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:34,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:34,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529327737] [2024-10-10 23:16:34,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529327737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:34,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:34,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:16:34,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712694064] [2024-10-10 23:16:34,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:34,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:16:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:16:34,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:34,527 INFO L87 Difference]: Start difference. First operand 698 states and 883 transitions. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:35,063 INFO L93 Difference]: Finished difference Result 1311 states and 1676 transitions. [2024-10-10 23:16:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:16:35,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 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 198 [2024-10-10 23:16:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:35,066 INFO L225 Difference]: With dead ends: 1311 [2024-10-10 23:16:35,066 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:16:35,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:35,068 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:35,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:16:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:16:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2611190817790532) internal successors, (879), 697 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 879 transitions. [2024-10-10 23:16:35,079 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 879 transitions. Word has length 198 [2024-10-10 23:16:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 879 transitions. [2024-10-10 23:16:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 879 transitions. [2024-10-10 23:16:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-10 23:16:35,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:35,083 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:35,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:16:35,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1308258989, now seen corresponding path program 1 times [2024-10-10 23:16:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531805887] [2024-10-10 23:16:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531805887] [2024-10-10 23:16:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531805887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923611380] [2024-10-10 23:16:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:35,306 INFO L87 Difference]: Start difference. First operand 698 states and 879 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:35,732 INFO L93 Difference]: Finished difference Result 1534 states and 2041 transitions. [2024-10-10 23:16:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 234 [2024-10-10 23:16:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:35,736 INFO L225 Difference]: With dead ends: 1534 [2024-10-10 23:16:35,737 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:16:35,739 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-10-10 23:16:35,740 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:35,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 186 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:16:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-10 23:16:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2594871794871796) internal successors, (1228), 975 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1228 transitions. [2024-10-10 23:16:35,760 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1228 transitions. Word has length 234 [2024-10-10 23:16:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:35,760 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1228 transitions. [2024-10-10 23:16:35,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1228 transitions. [2024-10-10 23:16:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-10 23:16:35,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:35,764 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:35,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:16:35,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:35,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash -371434596, now seen corresponding path program 1 times [2024-10-10 23:16:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888968011] [2024-10-10 23:16:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 102 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888968011] [2024-10-10 23:16:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888968011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637845495] [2024-10-10 23:16:36,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:36,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:16:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:36,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:36,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:16:36,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637845495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:16:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129973607] [2024-10-10 23:16:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:36,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:36,652 INFO L87 Difference]: Start difference. First operand 976 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:37,003 INFO L93 Difference]: Finished difference Result 2090 states and 2644 transitions. [2024-10-10 23:16:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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 277 [2024-10-10 23:16:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:37,007 INFO L225 Difference]: With dead ends: 2090 [2024-10-10 23:16:37,007 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:37,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:37,010 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:37,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:16:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-10 23:16:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1652035115722266) internal successors, (1460), 1253 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1460 transitions. [2024-10-10 23:16:37,029 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1460 transitions. Word has length 277 [2024-10-10 23:16:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:37,029 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1460 transitions. [2024-10-10 23:16:37,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1460 transitions. [2024-10-10 23:16:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-10 23:16:37,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:37,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:16:37,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:16:37,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:37,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1673586974, now seen corresponding path program 1 times [2024-10-10 23:16:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986871488] [2024-10-10 23:16:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 204 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986871488] [2024-10-10 23:16:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986871488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845455007] [2024-10-10 23:16:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:37,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:37,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:37,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:16:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:37,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:37,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-10 23:16:37,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:37,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845455007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:37,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:16:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046041311] [2024-10-10 23:16:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:37,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:37,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:16:37,819 INFO L87 Difference]: Start difference. First operand 1254 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:38,184 INFO L93 Difference]: Finished difference Result 2646 states and 3153 transitions. [2024-10-10 23:16:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 307 [2024-10-10 23:16:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:38,188 INFO L225 Difference]: With dead ends: 2646 [2024-10-10 23:16:38,188 INFO L226 Difference]: Without dead ends: 1532 [2024-10-10 23:16:38,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:16:38,190 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:38,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:16:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-10 23:16:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-10-10 23:16:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1868060091443502) internal successors, (1817), 1531 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1817 transitions. [2024-10-10 23:16:38,209 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1817 transitions. Word has length 307 [2024-10-10 23:16:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:38,209 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1817 transitions. [2024-10-10 23:16:38,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1817 transitions. [2024-10-10 23:16:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-10 23:16:38,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:38,213 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:38,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:16:38,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:38,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1622738679, now seen corresponding path program 1 times [2024-10-10 23:16:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002627449] [2024-10-10 23:16:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-10 23:16:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002627449] [2024-10-10 23:16:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002627449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584975243] [2024-10-10 23:16:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:38,707 INFO L87 Difference]: Start difference. First operand 1532 states and 1817 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:39,123 INFO L93 Difference]: Finished difference Result 2507 states and 2967 transitions. [2024-10-10 23:16:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 317 [2024-10-10 23:16:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:39,129 INFO L225 Difference]: With dead ends: 2507 [2024-10-10 23:16:39,130 INFO L226 Difference]: Without dead ends: 2505 [2024-10-10 23:16:39,130 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-10-10 23:16:39,131 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:39,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 35 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-10-10 23:16:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1254. [2024-10-10 23:16:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1835594573024741) internal successors, (1483), 1253 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1483 transitions. [2024-10-10 23:16:39,158 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1483 transitions. Word has length 317 [2024-10-10 23:16:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:39,158 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1483 transitions. [2024-10-10 23:16:39,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1483 transitions. [2024-10-10 23:16:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-10 23:16:39,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:39,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:16:39,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:39,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1881009525, now seen corresponding path program 1 times [2024-10-10 23:16:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295726792] [2024-10-10 23:16:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 331 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295726792] [2024-10-10 23:16:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295726792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285482500] [2024-10-10 23:16:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:39,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:39,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:16:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:39,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:39,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:16:39,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:39,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285482500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:39,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:39,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804267259] [2024-10-10 23:16:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:39,731 INFO L87 Difference]: Start difference. First operand 1254 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:40,110 INFO L93 Difference]: Finished difference Result 3202 states and 3813 transitions. [2024-10-10 23:16:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 345 [2024-10-10 23:16:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:40,117 INFO L225 Difference]: With dead ends: 3202 [2024-10-10 23:16:40,117 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:16:40,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:40,119 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:40,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 202 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:16:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:16:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.1509343555342597) internal successors, (2402), 2087 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2402 transitions. [2024-10-10 23:16:40,163 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2402 transitions. Word has length 345 [2024-10-10 23:16:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2402 transitions. [2024-10-10 23:16:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2402 transitions. [2024-10-10 23:16:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-10 23:16:40,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:40,168 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:40,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:16:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:16:40,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:40,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1984143323, now seen corresponding path program 1 times [2024-10-10 23:16:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019498562] [2024-10-10 23:16:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:16:40,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:40,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019498562] [2024-10-10 23:16:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019498562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246244683] [2024-10-10 23:16:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:40,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:40,640 INFO L87 Difference]: Start difference. First operand 2088 states and 2402 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:41,080 INFO L93 Difference]: Finished difference Result 4034 states and 4659 transitions. [2024-10-10 23:16:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 358 [2024-10-10 23:16:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:41,082 INFO L225 Difference]: With dead ends: 4034 [2024-10-10 23:16:41,082 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:16:41,087 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-10-10 23:16:41,088 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 100 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:41,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 209 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:16:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:16:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:16:41,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358 [2024-10-10 23:16:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:41,090 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:16:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:16:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:16:41,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:16:41,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:16:41,098 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:41,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:16:41,331 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:16:41,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:16:41 BoogieIcfgContainer [2024-10-10 23:16:41,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:16:41,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:16:41,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:16:41,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:16:41,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:29" (3/4) ... [2024-10-10 23:16:41,357 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:16:41,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:16:41,380 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:16:41,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:16:41,382 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:16:41,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:16:41,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:16:41,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:16:41,551 INFO L158 Benchmark]: Toolchain (without parser) took 13388.69ms. Allocated memory was 176.2MB in the beginning and 434.1MB in the end (delta: 257.9MB). Free memory was 103.8MB in the beginning and 286.2MB in the end (delta: -182.4MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,554 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:16:41,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.67ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 124.2MB in the end (delta: -20.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.28ms. Allocated memory is still 176.2MB. Free memory was 123.3MB in the beginning and 115.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,555 INFO L158 Benchmark]: Boogie Preprocessor took 71.54ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 105.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,555 INFO L158 Benchmark]: RCFGBuilder took 939.65ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 96.1MB in the end (delta: 9.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,555 INFO L158 Benchmark]: TraceAbstraction took 11617.35ms. Allocated memory was 176.2MB in the beginning and 434.1MB in the end (delta: 257.9MB). Free memory was 96.1MB in the beginning and 297.7MB in the end (delta: -201.6MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,555 INFO L158 Benchmark]: Witness Printer took 196.20ms. Allocated memory is still 434.1MB. Free memory was 297.7MB in the beginning and 286.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:16:41,557 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.43ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.67ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 124.2MB in the end (delta: -20.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.28ms. Allocated memory is still 176.2MB. Free memory was 123.3MB in the beginning and 115.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.54ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 105.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 939.65ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 96.1MB in the end (delta: 9.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11617.35ms. Allocated memory was 176.2MB in the beginning and 434.1MB in the end (delta: 257.9MB). Free memory was 96.1MB in the beginning and 297.7MB in the end (delta: -201.6MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Witness Printer took 196.20ms. Allocated memory is still 434.1MB. Free memory was 297.7MB in the beginning and 286.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 152]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1075 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1075 mSDsluCounter, 1367 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5084 IncrementalHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 1306 mSDtfsCounter, 5084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 1060 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2088occurred in iteration=12, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3687 NumberOfCodeBlocks, 3687 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3670 ConstructedInterpolants, 0 QuantifiedInterpolants, 14207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1483 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 2862/3162 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: 592]: Loop Invariant Derived loop invariant: (((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((((a19 <= 9) && (0 <= ((long long) a1 + 12))) && (a10 <= 3)) && (14 == a4)) && (a12 == 0))) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || ((((a10 == 1) && (8 <= a19)) && (14 == a4)) && (a12 == 0))) || (((((a19 <= 9) && (8 <= a19)) && (a10 <= 3)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:16:41,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE