./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/Problem11_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:01:26,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:01:26,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:01:26,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:01:26,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:01:26,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:01:26,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:01:26,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:01:26,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:01:26,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:01:26,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:01:26,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:01:26,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:01:26,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:01:26,119 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:01:26,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:01:26,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:01:26,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:01:26,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:01:26,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:01:26,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:01:26,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:01:26,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:01:26,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:01:26,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:01:26,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:01:26,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:01:26,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:01:26,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:01:26,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:01:26,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:01:26,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:01:26,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:01:26,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:01:26,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:01:26,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:01:26,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:01:26,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:01:26,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:01:26,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:01:26,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:01:26,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:01:26,128 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 [2024-10-23 21:01:26,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:01:26,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:01:26,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:01:26,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:01:26,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:01:26,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-10-23 21:01:27,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:01:28,109 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:01:28,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-10-23 21:01:28,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2977868/1c3c91cc3334451d9a19bd51a307eb11/FLAGc224a13d1 [2024-10-23 21:01:28,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2977868/1c3c91cc3334451d9a19bd51a307eb11 [2024-10-23 21:01:28,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:01:28,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:01:28,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:01:28,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:01:28,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:01:28,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26dc2552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28, skipping insertion in model container [2024-10-23 21:01:28,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:01:28,457 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/Problem11_label04.c[7746,7759] [2024-10-23 21:01:28,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:01:28,679 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:01:28,706 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/Problem11_label04.c[7746,7759] [2024-10-23 21:01:28,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:01:28,835 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:01:28,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28 WrapperNode [2024-10-23 21:01:28,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:01:28,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:01:28,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:01:28,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:01:28,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,965 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-23 21:01:28,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:01:28,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:01:28,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:01:28,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:01:28,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:28,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,082 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-23 21:01:29,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:01:29,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:01:29,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:01:29,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:01:29,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (1/1) ... [2024-10-23 21:01:29,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:01:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:01:29,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:01:29,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:01:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:01:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:01:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:01:29,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:01:29,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:01:29,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:01:30,721 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-23 21:01:30,721 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:01:30,784 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:01:30,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:01:30,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:30 BoogieIcfgContainer [2024-10-23 21:01:30,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:01:30,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:01:30,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:01:30,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:01:30,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:01:28" (1/3) ... [2024-10-23 21:01:30,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c28995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:01:30, skipping insertion in model container [2024-10-23 21:01:30,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:28" (2/3) ... [2024-10-23 21:01:30,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c28995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:01:30, skipping insertion in model container [2024-10-23 21:01:30,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:30" (3/3) ... [2024-10-23 21:01:30,796 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label04.c [2024-10-23 21:01:30,812 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:01:30,813 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:01:30,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:01:30,897 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;@3c9accd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:01:30,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:01:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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-23 21:01:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-23 21:01:30,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:30,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:30,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:30,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1331462066, now seen corresponding path program 1 times [2024-10-23 21:01:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402988386] [2024-10-23 21:01:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:31,123 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-23 21:01:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402988386] [2024-10-23 21:01:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402988386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614571415] [2024-10-23 21:01:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:31,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:01:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:01:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:01:31,161 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-23 21:01:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:31,217 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-23 21:01:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:01:31,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2024-10-23 21:01:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:31,232 INFO L225 Difference]: With dead ends: 441 [2024-10-23 21:01:31,232 INFO L226 Difference]: Without dead ends: 219 [2024-10-23 21:01:31,236 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-23 21:01:31,241 INFO L432 NwaCegarLoop]: 355 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, 355 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-23 21:01:31,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:01:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-23 21:01:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-23 21:01:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-23 21:01:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-23 21:01:31,303 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 52 [2024-10-23 21:01:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-23 21:01:31,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-23 21:01:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-23 21:01:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-23 21:01:31,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:31,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:31,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:01:31,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1527915673, now seen corresponding path program 1 times [2024-10-23 21:01:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387277996] [2024-10-23 21:01:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:31,555 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-23 21:01:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387277996] [2024-10-23 21:01:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387277996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:31,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501237983] [2024-10-23 21:01:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:31,563 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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-23 21:01:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:32,529 INFO L93 Difference]: Finished difference Result 633 states and 1034 transitions. [2024-10-23 21:01:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2024-10-23 21:01:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:32,532 INFO L225 Difference]: With dead ends: 633 [2024-10-23 21:01:32,532 INFO L226 Difference]: Without dead ends: 415 [2024-10-23 21:01:32,533 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-23 21:01:32,535 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 169 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:32,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 69 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:01:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-23 21:01:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2024-10-23 21:01:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.6157635467980296) internal successors, (656), 406 states have internal predecessors, (656), 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-23 21:01:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 656 transitions. [2024-10-23 21:01:32,558 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 656 transitions. Word has length 52 [2024-10-23 21:01:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:32,558 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 656 transitions. [2024-10-23 21:01:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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-23 21:01:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 656 transitions. [2024-10-23 21:01:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 21:01:32,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:32,564 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, 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] [2024-10-23 21:01:32,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:01:32,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 148667976, now seen corresponding path program 1 times [2024-10-23 21:01:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966011860] [2024-10-23 21:01:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966011860] [2024-10-23 21:01:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966011860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:32,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:32,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481451769] [2024-10-23 21:01:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:32,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:32,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:32,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:32,768 INFO L87 Difference]: Start difference. First operand 407 states and 656 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-23 21:01:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:33,485 INFO L93 Difference]: Finished difference Result 1190 states and 1929 transitions. [2024-10-23 21:01:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2024-10-23 21:01:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:33,489 INFO L225 Difference]: With dead ends: 1190 [2024-10-23 21:01:33,490 INFO L226 Difference]: Without dead ends: 784 [2024-10-23 21:01:33,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:33,498 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:33,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 150 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-10-23 21:01:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2024-10-23 21:01:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.439180537772087) internal successors, (1124), 781 states have internal predecessors, (1124), 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-23 21:01:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1124 transitions. [2024-10-23 21:01:33,559 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1124 transitions. Word has length 117 [2024-10-23 21:01:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:33,560 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1124 transitions. [2024-10-23 21:01:33,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-23 21:01:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1124 transitions. [2024-10-23 21:01:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-23 21:01:33,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:33,562 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:01:33,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1745251374, now seen corresponding path program 1 times [2024-10-23 21:01:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371515457] [2024-10-23 21:01:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371515457] [2024-10-23 21:01:33,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371515457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:33,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:33,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396095459] [2024-10-23 21:01:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:33,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:33,769 INFO L87 Difference]: Start difference. First operand 782 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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-23 21:01:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:34,452 INFO L93 Difference]: Finished difference Result 1947 states and 2800 transitions. [2024-10-23 21:01:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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-23 21:01:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:34,460 INFO L225 Difference]: With dead ends: 1947 [2024-10-23 21:01:34,460 INFO L226 Difference]: Without dead ends: 1166 [2024-10-23 21:01:34,462 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-23 21:01:34,465 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:34,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 114 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-23 21:01:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1153. [2024-10-23 21:01:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3394097222222223) internal successors, (1543), 1152 states have internal predecessors, (1543), 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-23 21:01:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1543 transitions. [2024-10-23 21:01:34,487 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1543 transitions. Word has length 120 [2024-10-23 21:01:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:34,487 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1543 transitions. [2024-10-23 21:01:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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-23 21:01:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1543 transitions. [2024-10-23 21:01:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-23 21:01:34,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:34,490 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, 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] [2024-10-23 21:01:34,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:01:34,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1500934546, now seen corresponding path program 1 times [2024-10-23 21:01:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715865747] [2024-10-23 21:01:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715865747] [2024-10-23 21:01:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715865747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131576687] [2024-10-23 21:01:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:34,799 INFO L87 Difference]: Start difference. First operand 1153 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-23 21:01:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:35,517 INFO L93 Difference]: Finished difference Result 2675 states and 3528 transitions. [2024-10-23 21:01:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2024-10-23 21:01:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:35,523 INFO L225 Difference]: With dead ends: 2675 [2024-10-23 21:01:35,523 INFO L226 Difference]: Without dead ends: 1523 [2024-10-23 21:01:35,525 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-23 21:01:35,526 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:35,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 187 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-23 21:01:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1522. [2024-10-23 21:01:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.2689020381328073) internal successors, (1930), 1521 states have internal predecessors, (1930), 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-23 21:01:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1930 transitions. [2024-10-23 21:01:35,558 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1930 transitions. Word has length 121 [2024-10-23 21:01:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:35,558 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1930 transitions. [2024-10-23 21:01:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-23 21:01:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1930 transitions. [2024-10-23 21:01:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-23 21:01:35,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:35,562 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:01:35,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:35,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash 60656597, now seen corresponding path program 1 times [2024-10-23 21:01:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561132180] [2024-10-23 21:01:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561132180] [2024-10-23 21:01:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561132180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:35,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:35,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334369680] [2024-10-23 21:01:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:35,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:35,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:35,775 INFO L87 Difference]: Start difference. First operand 1522 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-23 21:01:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:36,534 INFO L93 Difference]: Finished difference Result 3967 states and 5150 transitions. [2024-10-23 21:01:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:36,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 179 [2024-10-23 21:01:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:36,545 INFO L225 Difference]: With dead ends: 3967 [2024-10-23 21:01:36,545 INFO L226 Difference]: Without dead ends: 2630 [2024-10-23 21:01:36,548 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-23 21:01:36,549 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:36,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-23 21:01:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2446. [2024-10-23 21:01:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2445 states have (on average 1.223721881390593) internal successors, (2992), 2445 states have internal predecessors, (2992), 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-23 21:01:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2992 transitions. [2024-10-23 21:01:36,596 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2992 transitions. Word has length 179 [2024-10-23 21:01:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:36,597 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 2992 transitions. [2024-10-23 21:01:36,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-23 21:01:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2992 transitions. [2024-10-23 21:01:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-23 21:01:36,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:36,603 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:01:36,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -575257995, now seen corresponding path program 1 times [2024-10-23 21:01:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418919945] [2024-10-23 21:01:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-23 21:01:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418919945] [2024-10-23 21:01:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418919945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:36,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:36,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120168369] [2024-10-23 21:01:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:36,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:36,829 INFO L87 Difference]: Start difference. First operand 2446 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-23 21:01:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:37,498 INFO L93 Difference]: Finished difference Result 5265 states and 6462 transitions. [2024-10-23 21:01:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:37,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 195 [2024-10-23 21:01:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:37,508 INFO L225 Difference]: With dead ends: 5265 [2024-10-23 21:01:37,508 INFO L226 Difference]: Without dead ends: 3004 [2024-10-23 21:01:37,511 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-23 21:01:37,512 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:37,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 151 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:01:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2024-10-23 21:01:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2819. [2024-10-23 21:01:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2818 states have (on average 1.2221433640880057) internal successors, (3444), 2818 states have internal predecessors, (3444), 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-23 21:01:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3444 transitions. [2024-10-23 21:01:37,557 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3444 transitions. Word has length 195 [2024-10-23 21:01:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:37,558 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3444 transitions. [2024-10-23 21:01:37,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-23 21:01:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3444 transitions. [2024-10-23 21:01:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-23 21:01:37,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:37,561 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:37,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:01:37,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:37,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1071315023, now seen corresponding path program 1 times [2024-10-23 21:01:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342180990] [2024-10-23 21:01:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342180990] [2024-10-23 21:01:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342180990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473992116] [2024-10-23 21:01:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:37,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:37,801 INFO L87 Difference]: Start difference. First operand 2819 states and 3444 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-23 21:01:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:38,529 INFO L93 Difference]: Finished difference Result 6566 states and 8100 transitions. [2024-10-23 21:01:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 232 [2024-10-23 21:01:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:38,542 INFO L225 Difference]: With dead ends: 6566 [2024-10-23 21:01:38,543 INFO L226 Difference]: Without dead ends: 3932 [2024-10-23 21:01:38,547 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-23 21:01:38,548 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:38,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 329 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2024-10-23 21:01:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3555. [2024-10-23 21:01:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 3554 states have (on average 1.2115925717501408) internal successors, (4306), 3554 states have internal predecessors, (4306), 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-23 21:01:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4306 transitions. [2024-10-23 21:01:38,608 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4306 transitions. Word has length 232 [2024-10-23 21:01:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 4306 transitions. [2024-10-23 21:01:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-23 21:01:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4306 transitions. [2024-10-23 21:01:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-23 21:01:38,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:38,613 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:38,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:01:38,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 86722159, now seen corresponding path program 1 times [2024-10-23 21:01:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711539365] [2024-10-23 21:01:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-23 21:01:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711539365] [2024-10-23 21:01:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711539365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130983233] [2024-10-23 21:01:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:38,910 INFO L87 Difference]: Start difference. First operand 3555 states and 4306 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-23 21:01:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:39,684 INFO L93 Difference]: Finished difference Result 9318 states and 11374 transitions. [2024-10-23 21:01:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 233 [2024-10-23 21:01:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:39,703 INFO L225 Difference]: With dead ends: 9318 [2024-10-23 21:01:39,703 INFO L226 Difference]: Without dead ends: 5764 [2024-10-23 21:01:39,708 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-23 21:01:39,709 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 178 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:39,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2024-10-23 21:01:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4843. [2024-10-23 21:01:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4842 states have (on average 1.2073523337463858) internal successors, (5846), 4842 states have internal predecessors, (5846), 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-23 21:01:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 5846 transitions. [2024-10-23 21:01:39,817 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 5846 transitions. Word has length 233 [2024-10-23 21:01:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 5846 transitions. [2024-10-23 21:01:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-23 21:01:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 5846 transitions. [2024-10-23 21:01:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-23 21:01:39,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:39,827 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:39,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:01:39,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 39959345, now seen corresponding path program 1 times [2024-10-23 21:01:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86950470] [2024-10-23 21:01:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-23 21:01:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86950470] [2024-10-23 21:01:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86950470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577766302] [2024-10-23 21:01:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:40,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:40,043 INFO L87 Difference]: Start difference. First operand 4843 states and 5846 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-23 21:01:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:40,787 INFO L93 Difference]: Finished difference Result 9683 states and 11689 transitions. [2024-10-23 21:01:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:40,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 313 [2024-10-23 21:01:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:40,803 INFO L225 Difference]: With dead ends: 9683 [2024-10-23 21:01:40,803 INFO L226 Difference]: Without dead ends: 4841 [2024-10-23 21:01:40,808 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-23 21:01:40,809 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 182 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:40,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 301 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:01:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2024-10-23 21:01:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 4657. [2024-10-23 21:01:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4657 states, 4656 states have (on average 1.154209621993127) internal successors, (5374), 4656 states have internal predecessors, (5374), 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-23 21:01:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 5374 transitions. [2024-10-23 21:01:40,882 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 5374 transitions. Word has length 313 [2024-10-23 21:01:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 4657 states and 5374 transitions. [2024-10-23 21:01:40,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-23 21:01:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 5374 transitions. [2024-10-23 21:01:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-23 21:01:40,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:40,893 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:40,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:01:40,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:40,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1192125312, now seen corresponding path program 1 times [2024-10-23 21:01:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658319844] [2024-10-23 21:01:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-23 21:01:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:41,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658319844] [2024-10-23 21:01:41,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658319844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:41,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:41,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:41,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110395401] [2024-10-23 21:01:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:41,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:41,124 INFO L87 Difference]: Start difference. First operand 4657 states and 5374 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-23 21:01:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:41,533 INFO L93 Difference]: Finished difference Result 9309 states and 10743 transitions. [2024-10-23 21:01:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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 334 [2024-10-23 21:01:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:41,558 INFO L225 Difference]: With dead ends: 9309 [2024-10-23 21:01:41,558 INFO L226 Difference]: Without dead ends: 4653 [2024-10-23 21:01:41,563 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-23 21:01:41,564 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:41,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 38 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:01:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2024-10-23 21:01:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 4653. [2024-10-23 21:01:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4652 states have (on average 1.1532674118658641) internal successors, (5365), 4652 states have internal predecessors, (5365), 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-23 21:01:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 5365 transitions. [2024-10-23 21:01:41,666 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 5365 transitions. Word has length 334 [2024-10-23 21:01:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:41,666 INFO L471 AbstractCegarLoop]: Abstraction has 4653 states and 5365 transitions. [2024-10-23 21:01:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-23 21:01:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 5365 transitions. [2024-10-23 21:01:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-23 21:01:41,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:41,677 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:41,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:01:41,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2110470235, now seen corresponding path program 1 times [2024-10-23 21:01:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611369131] [2024-10-23 21:01:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-23 21:01:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611369131] [2024-10-23 21:01:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611369131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:41,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866966406] [2024-10-23 21:01:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:41,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:41,912 INFO L87 Difference]: Start difference. First operand 4653 states and 5365 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-23 21:01:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:42,759 INFO L93 Difference]: Finished difference Result 10411 states and 12094 transitions. [2024-10-23 21:01:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:42,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 335 [2024-10-23 21:01:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:42,774 INFO L225 Difference]: With dead ends: 10411 [2024-10-23 21:01:42,778 INFO L226 Difference]: Without dead ends: 5759 [2024-10-23 21:01:42,783 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-23 21:01:42,784 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 142 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:42,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 362 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:01:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-10-23 21:01:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5204. [2024-10-23 21:01:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 5203 states have (on average 1.1391504901018643) internal successors, (5927), 5203 states have internal predecessors, (5927), 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-23 21:01:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 5927 transitions. [2024-10-23 21:01:42,862 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 5927 transitions. Word has length 335 [2024-10-23 21:01:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 5204 states and 5927 transitions. [2024-10-23 21:01:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-23 21:01:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 5927 transitions. [2024-10-23 21:01:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-10-23 21:01:42,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:42,874 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:01:42,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:01:42,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:42,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash -175920622, now seen corresponding path program 1 times [2024-10-23 21:01:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854673275] [2024-10-23 21:01:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-23 21:01:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854673275] [2024-10-23 21:01:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854673275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057273003] [2024-10-23 21:01:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:01:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:01:43,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:01:43,228 INFO L87 Difference]: Start difference. First operand 5204 states and 5927 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 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-23 21:01:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:44,463 INFO L93 Difference]: Finished difference Result 14287 states and 16264 transitions. [2024-10-23 21:01:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:01:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 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 389 [2024-10-23 21:01:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:44,479 INFO L225 Difference]: With dead ends: 14287 [2024-10-23 21:01:44,479 INFO L226 Difference]: Without dead ends: 9084 [2024-10-23 21:01:44,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:01:44,487 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:44,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 61 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:01:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2024-10-23 21:01:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 8896. [2024-10-23 21:01:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8896 states, 8895 states have (on average 1.1289488476672287) internal successors, (10042), 8895 states have internal predecessors, (10042), 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-23 21:01:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8896 states to 8896 states and 10042 transitions. [2024-10-23 21:01:44,619 INFO L78 Accepts]: Start accepts. Automaton has 8896 states and 10042 transitions. Word has length 389 [2024-10-23 21:01:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:44,619 INFO L471 AbstractCegarLoop]: Abstraction has 8896 states and 10042 transitions. [2024-10-23 21:01:44,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 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-23 21:01:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8896 states and 10042 transitions. [2024-10-23 21:01:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-23 21:01:44,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:44,636 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:01:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:01:44,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:44,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1178068175, now seen corresponding path program 1 times [2024-10-23 21:01:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386181100] [2024-10-23 21:01:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-23 21:01:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386181100] [2024-10-23 21:01:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386181100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:44,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870033465] [2024-10-23 21:01:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:44,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:44,962 INFO L87 Difference]: Start difference. First operand 8896 states and 10042 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-23 21:01:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:45,571 INFO L93 Difference]: Finished difference Result 17418 states and 19679 transitions. [2024-10-23 21:01:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:45,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 456 [2024-10-23 21:01:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:45,587 INFO L225 Difference]: With dead ends: 17418 [2024-10-23 21:01:45,587 INFO L226 Difference]: Without dead ends: 8893 [2024-10-23 21:01:45,596 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-23 21:01:45,597 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:45,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 350 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:01:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8893 states. [2024-10-23 21:01:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8893 to 8709. [2024-10-23 21:01:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 8708 states have (on average 1.1120808451998163) internal successors, (9684), 8708 states have internal predecessors, (9684), 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-23 21:01:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 9684 transitions. [2024-10-23 21:01:45,713 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 9684 transitions. Word has length 456 [2024-10-23 21:01:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 8709 states and 9684 transitions. [2024-10-23 21:01:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-23 21:01:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 9684 transitions. [2024-10-23 21:01:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-23 21:01:45,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:45,731 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-23 21:01:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:01:45,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:45,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1335358163, now seen corresponding path program 1 times [2024-10-23 21:01:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334276971] [2024-10-23 21:01:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-10-23 21:01:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334276971] [2024-10-23 21:01:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334276971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:46,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133224784] [2024-10-23 21:01:46,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:46,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:46,299 INFO L87 Difference]: Start difference. First operand 8709 states and 9684 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-23 21:01:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:46,881 INFO L93 Difference]: Finished difference Result 18706 states and 20954 transitions. [2024-10-23 21:01:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 524 [2024-10-23 21:01:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:46,899 INFO L225 Difference]: With dead ends: 18706 [2024-10-23 21:01:46,899 INFO L226 Difference]: Without dead ends: 10366 [2024-10-23 21:01:46,910 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-23 21:01:46,911 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 122 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:46,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 144 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2024-10-23 21:01:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 8517. [2024-10-23 21:01:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8517 states, 8516 states have (on average 1.114138093001409) internal successors, (9488), 8516 states have internal predecessors, (9488), 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-23 21:01:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8517 states to 8517 states and 9488 transitions. [2024-10-23 21:01:47,023 INFO L78 Accepts]: Start accepts. Automaton has 8517 states and 9488 transitions. Word has length 524 [2024-10-23 21:01:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 8517 states and 9488 transitions. [2024-10-23 21:01:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-23 21:01:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8517 states and 9488 transitions. [2024-10-23 21:01:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-10-23 21:01:47,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:47,040 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:47,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:01:47,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:47,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1087702024, now seen corresponding path program 1 times [2024-10-23 21:01:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868781399] [2024-10-23 21:01:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-10-23 21:01:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868781399] [2024-10-23 21:01:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868781399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680510396] [2024-10-23 21:01:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:47,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:47,609 INFO L87 Difference]: Start difference. First operand 8517 states and 9488 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-23 21:01:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:48,192 INFO L93 Difference]: Finished difference Result 17580 states and 19583 transitions. [2024-10-23 21:01:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 628 [2024-10-23 21:01:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:48,193 INFO L225 Difference]: With dead ends: 17580 [2024-10-23 21:01:48,193 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:01:48,205 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-23 21:01:48,206 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:48,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 316 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:01:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:01:48,208 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-23 21:01:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:01:48,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2024-10-23 21:01:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:48,208 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:01:48,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-23 21:01:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:01:48,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:01:48,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:01:48,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:01:48,215 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:48,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:01:49,247 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:01:49,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:01:49 BoogieIcfgContainer [2024-10-23 21:01:49,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:01:49,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:01:49,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:01:49,271 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:01:49,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:30" (3/4) ... [2024-10-23 21:01:49,274 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:01:49,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 21:01:49,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:01:49,302 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:01:49,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:01:49,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:01:49,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:01:49,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:01:49,479 INFO L158 Benchmark]: Toolchain (without parser) took 21322.51ms. Allocated memory was 180.4MB in the beginning and 620.8MB in the end (delta: 440.4MB). Free memory was 132.3MB in the beginning and 281.6MB in the end (delta: -149.3MB). Peak memory consumption was 292.9MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,480 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:01:49,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.33ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 84.8MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.52ms. Allocated memory is still 180.4MB. Free memory was 84.8MB in the beginning and 67.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,481 INFO L158 Benchmark]: Boogie Preprocessor took 218.10ms. Allocated memory is still 180.4MB. Free memory was 67.3MB in the beginning and 131.2MB in the end (delta: -63.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,482 INFO L158 Benchmark]: RCFGBuilder took 1600.71ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 131.2MB in the beginning and 200.8MB in the end (delta: -69.6MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,482 INFO L158 Benchmark]: TraceAbstraction took 18481.09ms. Allocated memory was 266.3MB in the beginning and 620.8MB in the end (delta: 354.4MB). Free memory was 199.7MB in the beginning and 298.4MB in the end (delta: -98.7MB). Peak memory consumption was 348.0MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,482 INFO L158 Benchmark]: Witness Printer took 207.99ms. Allocated memory is still 620.8MB. Free memory was 298.4MB in the beginning and 281.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:01:49,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.33ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 84.8MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.52ms. Allocated memory is still 180.4MB. Free memory was 84.8MB in the beginning and 67.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 218.10ms. Allocated memory is still 180.4MB. Free memory was 67.3MB in the beginning and 131.2MB in the end (delta: -63.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1600.71ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 131.2MB in the beginning and 200.8MB in the end (delta: -69.6MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18481.09ms. Allocated memory was 266.3MB in the beginning and 620.8MB in the end (delta: 354.4MB). Free memory was 199.7MB in the beginning and 298.4MB in the end (delta: -98.7MB). Peak memory consumption was 348.0MB. Max. memory is 16.1GB. * Witness Printer took 207.99ms. Allocated memory is still 620.8MB. Free memory was 298.4MB in the beginning and 281.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 175]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2229 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2229 mSDsluCounter, 3217 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 1431 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8170 IncrementalHoareTripleChecker+Invalid, 9601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1431 mSolverCounterUnsat, 2923 mSDtfsCounter, 8170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8896occurred in iteration=13, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 4651 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 4280 NumberOfCodeBlocks, 4280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4264 ConstructedInterpolants, 0 QuantifiedInterpolants, 7919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 4703/4703 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((10 <= a25) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 11) && (278 <= a29)) && (a23 <= 312)) && (a8 == 15))) || ((((a29 <= 140) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((278 <= a29) && (a25 <= 10)) && (a23 <= 312)) && (a8 == 15))) || (((a4 == 1) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a8 == 15) && (a25 == 10)) && (a29 <= 130))) || ((a25 == 12) && (a8 == 15))) || ((((a25 <= 10) && (a23 <= 312)) && (a8 == 15)) && (a29 <= 130))) || ((((a29 <= 140) && (a25 == 11)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:01:49,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE