./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label03.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 270b49fc6fbf3a6d565e1c23dc80c7cece24e766c52320c8c625102e15c9685f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:28:35,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:28:35,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:28:35,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:28:35,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:28:35,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:28:35,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:28:35,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:28:35,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:28:35,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:28:35,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:28:35,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:28:35,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:28:35,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:28:35,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:28:35,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:28:35,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:28:35,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:28:35,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:28:35,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:28:35,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:28:35,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:28:35,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:28:35,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:28:35,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:28:35,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:28:35,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:28:35,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:28:35,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:28:35,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:28:35,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:28:35,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:28:35,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:35,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:28:35,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:28:35,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:28:35,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:28:35,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:28:35,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:28:35,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:28:35,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:28:35,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:28:35,820 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 -> 270b49fc6fbf3a6d565e1c23dc80c7cece24e766c52320c8c625102e15c9685f [2024-11-08 10:28:36,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:28:36,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:28:36,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:28:36,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:28:36,115 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:28:36,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label03.c [2024-11-08 10:28:37,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:28:37,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:28:37,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label03.c [2024-11-08 10:28:37,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207828d9c/14bf511ef85e4b06852ce870273455af/FLAG2a529b603 [2024-11-08 10:28:37,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207828d9c/14bf511ef85e4b06852ce870273455af [2024-11-08 10:28:37,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:28:37,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:28:37,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:37,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:28:37,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:28:37,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:37" (1/1) ... [2024-11-08 10:28:37,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739ff84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:37, skipping insertion in model container [2024-11-08 10:28:37,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:37" (1/1) ... [2024-11-08 10:28:38,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:28:38,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label03.c[56355,56368] [2024-11-08 10:28:38,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:38,557 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:28:38,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label03.c[56355,56368] [2024-11-08 10:28:38,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:38,755 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:28:38,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38 WrapperNode [2024-11-08 10:28:38,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:38,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:38,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:28:38,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:28:38,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:38,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:38,918 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:28:38,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:38,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:28:38,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:28:38,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:28:38,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:38,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:38,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,001 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:28:39,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:28:39,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:28:39,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:28:39,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:28:39,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (1/1) ... [2024-11-08 10:28:39,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:39,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:28:39,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:28:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:28:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:28:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:28:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:28:39,362 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:28:39,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:28:41,226 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:28:41,227 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:28:41,254 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:28:41,256 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:28:41,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:41 BoogieIcfgContainer [2024-11-08 10:28:41,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:28:41,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:28:41,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:28:41,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:28:41,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:37" (1/3) ... [2024-11-08 10:28:41,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127b849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:41, skipping insertion in model container [2024-11-08 10:28:41,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:38" (2/3) ... [2024-11-08 10:28:41,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127b849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:41, skipping insertion in model container [2024-11-08 10:28:41,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:41" (3/3) ... [2024-11-08 10:28:41,266 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label03.c [2024-11-08 10:28:41,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:28:41,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:28:41,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:28:41,371 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;@dc5b8ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:28:41,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:28:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 10:28:41,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:41,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:41,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:41,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 303295378, now seen corresponding path program 1 times [2024-11-08 10:28:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053116183] [2024-11-08 10:28:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053116183] [2024-11-08 10:28:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053116183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746571930] [2024-11-08 10:28:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:42,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:42,348 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:43,509 INFO L93 Difference]: Finished difference Result 810 states and 1445 transitions. [2024-11-08 10:28:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 164 [2024-11-08 10:28:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:43,529 INFO L225 Difference]: With dead ends: 810 [2024-11-08 10:28:43,529 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 10:28:43,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:43,538 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 90 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:43,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 10:28:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 10:28:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2024-11-08 10:28:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2024-11-08 10:28:43,601 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 164 [2024-11-08 10:28:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:43,602 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2024-11-08 10:28:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2024-11-08 10:28:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 10:28:43,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:43,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:43,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:28:43,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1704238513, now seen corresponding path program 1 times [2024-11-08 10:28:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372632035] [2024-11-08 10:28:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372632035] [2024-11-08 10:28:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372632035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622060476] [2024-11-08 10:28:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:43,843 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:44,598 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2024-11-08 10:28:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 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 172 [2024-11-08 10:28:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:44,602 INFO L225 Difference]: With dead ends: 1312 [2024-11-08 10:28:44,603 INFO L226 Difference]: Without dead ends: 870 [2024-11-08 10:28:44,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:44,605 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:44,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-08 10:28:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2024-11-08 10:28:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3953216374269006) internal successors, (1193), 855 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1193 transitions. [2024-11-08 10:28:44,653 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1193 transitions. Word has length 172 [2024-11-08 10:28:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1193 transitions. [2024-11-08 10:28:44,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1193 transitions. [2024-11-08 10:28:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 10:28:44,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:44,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:28:44,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:44,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1955143716, now seen corresponding path program 1 times [2024-11-08 10:28:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:44,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983410721] [2024-11-08 10:28:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983410721] [2024-11-08 10:28:44,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983410721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:44,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:44,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612552793] [2024-11-08 10:28:44,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:44,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:44,985 INFO L87 Difference]: Start difference. First operand 856 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:45,762 INFO L93 Difference]: Finished difference Result 2530 states and 3532 transitions. [2024-11-08 10:28:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-11-08 10:28:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:45,772 INFO L225 Difference]: With dead ends: 2530 [2024-11-08 10:28:45,773 INFO L226 Difference]: Without dead ends: 1676 [2024-11-08 10:28:45,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:45,777 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 101 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:45,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 357 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-11-08 10:28:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1671. [2024-11-08 10:28:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.3323353293413174) internal successors, (2225), 1670 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2225 transitions. [2024-11-08 10:28:45,827 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2225 transitions. Word has length 179 [2024-11-08 10:28:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:45,828 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2225 transitions. [2024-11-08 10:28:45,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2225 transitions. [2024-11-08 10:28:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 10:28:45,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:45,835 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:45,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:28:45,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1792558056, now seen corresponding path program 1 times [2024-11-08 10:28:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610539664] [2024-11-08 10:28:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:46,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610539664] [2024-11-08 10:28:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610539664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408356347] [2024-11-08 10:28:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:46,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:46,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:46,235 INFO L87 Difference]: Start difference. First operand 1671 states and 2225 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:47,033 INFO L93 Difference]: Finished difference Result 4162 states and 5493 transitions. [2024-11-08 10:28:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2024-11-08 10:28:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:47,042 INFO L225 Difference]: With dead ends: 4162 [2024-11-08 10:28:47,043 INFO L226 Difference]: Without dead ends: 2493 [2024-11-08 10:28:47,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:47,046 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 216 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:47,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 368 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2024-11-08 10:28:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2489. [2024-11-08 10:28:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2488 states have (on average 1.2885852090032155) internal successors, (3206), 2488 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3206 transitions. [2024-11-08 10:28:47,090 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3206 transitions. Word has length 185 [2024-11-08 10:28:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:47,091 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3206 transitions. [2024-11-08 10:28:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3206 transitions. [2024-11-08 10:28:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 10:28:47,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:47,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:47,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:28:47,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash -669662216, now seen corresponding path program 1 times [2024-11-08 10:28:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867296605] [2024-11-08 10:28:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:47,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867296605] [2024-11-08 10:28:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867296605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:47,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300462650] [2024-11-08 10:28:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:47,367 INFO L87 Difference]: Start difference. First operand 2489 states and 3206 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:48,197 INFO L93 Difference]: Finished difference Result 6227 states and 8004 transitions. [2024-11-08 10:28:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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 192 [2024-11-08 10:28:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:48,211 INFO L225 Difference]: With dead ends: 6227 [2024-11-08 10:28:48,211 INFO L226 Difference]: Without dead ends: 3740 [2024-11-08 10:28:48,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:48,216 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 221 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:48,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 162 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2024-11-08 10:28:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3735. [2024-11-08 10:28:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 3734 states have (on average 1.279325120514194) internal successors, (4777), 3734 states have internal predecessors, (4777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4777 transitions. [2024-11-08 10:28:48,283 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4777 transitions. Word has length 192 [2024-11-08 10:28:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:48,283 INFO L471 AbstractCegarLoop]: Abstraction has 3735 states and 4777 transitions. [2024-11-08 10:28:48,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4777 transitions. [2024-11-08 10:28:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 10:28:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:48,290 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:28:48,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 858730448, now seen corresponding path program 1 times [2024-11-08 10:28:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385127996] [2024-11-08 10:28:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:28:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:48,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385127996] [2024-11-08 10:28:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385127996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:48,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898764490] [2024-11-08 10:28:48,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:48,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:48,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:48,648 INFO L87 Difference]: Start difference. First operand 3735 states and 4777 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-11-08 10:28:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:49,470 INFO L93 Difference]: Finished difference Result 9119 states and 11806 transitions. [2024-11-08 10:28:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:49,470 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 198 [2024-11-08 10:28:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:49,489 INFO L225 Difference]: With dead ends: 9119 [2024-11-08 10:28:49,489 INFO L226 Difference]: Without dead ends: 5386 [2024-11-08 10:28:49,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:49,497 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 216 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 364 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2024-11-08 10:28:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 5368. [2024-11-08 10:28:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 5367 states have (on average 1.2554499720514254) internal successors, (6738), 5367 states have internal predecessors, (6738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 6738 transitions. [2024-11-08 10:28:49,665 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 6738 transitions. Word has length 198 [2024-11-08 10:28:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:49,665 INFO L471 AbstractCegarLoop]: Abstraction has 5368 states and 6738 transitions. [2024-11-08 10:28:49,665 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-11-08 10:28:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 6738 transitions. [2024-11-08 10:28:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 10:28:49,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:49,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:28:49,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -973847901, now seen corresponding path program 1 times [2024-11-08 10:28:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745179976] [2024-11-08 10:28:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745179976] [2024-11-08 10:28:50,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745179976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:28:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3091304] [2024-11-08 10:28:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:50,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:28:50,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:28:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:50,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:28:50,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:28:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:28:50,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:28:50,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3091304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:50,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:28:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 10:28:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232934429] [2024-11-08 10:28:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:50,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:50,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:50,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:50,587 INFO L87 Difference]: Start difference. First operand 5368 states and 6738 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:51,404 INFO L93 Difference]: Finished difference Result 16041 states and 20133 transitions. [2024-11-08 10:28:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 199 [2024-11-08 10:28:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:51,442 INFO L225 Difference]: With dead ends: 16041 [2024-11-08 10:28:51,442 INFO L226 Difference]: Without dead ends: 10675 [2024-11-08 10:28:51,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:51,455 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 97 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:51,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 188 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2024-11-08 10:28:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10673. [2024-11-08 10:28:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10673 states, 10672 states have (on average 1.2162668665667167) internal successors, (12980), 10672 states have internal predecessors, (12980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 12980 transitions. [2024-11-08 10:28:51,661 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 12980 transitions. Word has length 199 [2024-11-08 10:28:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:51,661 INFO L471 AbstractCegarLoop]: Abstraction has 10673 states and 12980 transitions. [2024-11-08 10:28:51,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 12980 transitions. [2024-11-08 10:28:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 10:28:51,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:51,679 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:51,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:28:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:51,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1312945912, now seen corresponding path program 1 times [2024-11-08 10:28:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633999618] [2024-11-08 10:28:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:28:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633999618] [2024-11-08 10:28:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633999618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:28:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177317218] [2024-11-08 10:28:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:52,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:52,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:52,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:28:52,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:28:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:52,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:28:52,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:28:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:52,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:28:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177317218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:52,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:28:52,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:28:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130487643] [2024-11-08 10:28:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:52,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:52,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:52,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:52,503 INFO L87 Difference]: Start difference. First operand 10673 states and 12980 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:53,358 INFO L93 Difference]: Finished difference Result 27034 states and 33455 transitions. [2024-11-08 10:28:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 214 [2024-11-08 10:28:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:53,396 INFO L225 Difference]: With dead ends: 27034 [2024-11-08 10:28:53,396 INFO L226 Difference]: Without dead ends: 16363 [2024-11-08 10:28:53,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:53,414 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 222 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:53,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 409 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16363 states. [2024-11-08 10:28:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16363 to 15951. [2024-11-08 10:28:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15951 states, 15950 states have (on average 1.1742319749216301) internal successors, (18729), 15950 states have internal predecessors, (18729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 18729 transitions. [2024-11-08 10:28:53,658 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 18729 transitions. Word has length 214 [2024-11-08 10:28:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:53,659 INFO L471 AbstractCegarLoop]: Abstraction has 15951 states and 18729 transitions. [2024-11-08 10:28:53,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 18729 transitions. [2024-11-08 10:28:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 10:28:53,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:53,679 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:53,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:28:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 10:28:53,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:53,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 31886211, now seen corresponding path program 1 times [2024-11-08 10:28:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235848697] [2024-11-08 10:28:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:28:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235848697] [2024-11-08 10:28:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235848697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:54,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:54,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:54,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219119499] [2024-11-08 10:28:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:54,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:28:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:28:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:54,390 INFO L87 Difference]: Start difference. First operand 15951 states and 18729 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 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-11-08 10:28:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:55,561 INFO L93 Difference]: Finished difference Result 31933 states and 37521 transitions. [2024-11-08 10:28:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:28:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 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 228 [2024-11-08 10:28:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:55,594 INFO L225 Difference]: With dead ends: 31933 [2024-11-08 10:28:55,594 INFO L226 Difference]: Without dead ends: 15984 [2024-11-08 10:28:55,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:55,615 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 407 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:55,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 208 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 10:28:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15984 states. [2024-11-08 10:28:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15984 to 14732. [2024-11-08 10:28:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14732 states, 14731 states have (on average 1.177448917249338) internal successors, (17345), 14731 states have internal predecessors, (17345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 17345 transitions. [2024-11-08 10:28:55,821 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 17345 transitions. Word has length 228 [2024-11-08 10:28:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:55,822 INFO L471 AbstractCegarLoop]: Abstraction has 14732 states and 17345 transitions. [2024-11-08 10:28:55,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 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-11-08 10:28:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 17345 transitions. [2024-11-08 10:28:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 10:28:55,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:55,842 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:55,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:28:55,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:55,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1812442962, now seen corresponding path program 1 times [2024-11-08 10:28:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:55,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901947711] [2024-11-08 10:28:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 10:28:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901947711] [2024-11-08 10:28:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901947711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:28:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188164089] [2024-11-08 10:28:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:56,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:56,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:28:56,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:28:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:56,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:28:56,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:28:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-08 10:28:56,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:28:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188164089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:56,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:28:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:28:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136440128] [2024-11-08 10:28:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:56,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:56,704 INFO L87 Difference]: Start difference. First operand 14732 states and 17345 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:57,563 INFO L93 Difference]: Finished difference Result 41866 states and 49368 transitions. [2024-11-08 10:28:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 235 [2024-11-08 10:28:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:57,610 INFO L225 Difference]: With dead ends: 41866 [2024-11-08 10:28:57,611 INFO L226 Difference]: Without dead ends: 27136 [2024-11-08 10:28:57,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:57,627 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 89 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 166 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27136 states. [2024-11-08 10:28:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27136 to 25912. [2024-11-08 10:28:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25912 states, 25911 states have (on average 1.160781135425109) internal successors, (30077), 25911 states have internal predecessors, (30077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25912 states to 25912 states and 30077 transitions. [2024-11-08 10:28:57,950 INFO L78 Accepts]: Start accepts. Automaton has 25912 states and 30077 transitions. Word has length 235 [2024-11-08 10:28:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 25912 states and 30077 transitions. [2024-11-08 10:28:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25912 states and 30077 transitions. [2024-11-08 10:28:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 10:28:57,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:57,983 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, 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] [2024-11-08 10:28:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:28:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:58,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -118373097, now seen corresponding path program 1 times [2024-11-08 10:28:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79925882] [2024-11-08 10:28:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79925882] [2024-11-08 10:28:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79925882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949976830] [2024-11-08 10:28:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:58,412 INFO L87 Difference]: Start difference. First operand 25912 states and 30077 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:59,335 INFO L93 Difference]: Finished difference Result 59178 states and 69233 transitions. [2024-11-08 10:28:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:59,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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 239 [2024-11-08 10:28:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:59,388 INFO L225 Difference]: With dead ends: 59178 [2024-11-08 10:28:59,388 INFO L226 Difference]: Without dead ends: 33268 [2024-11-08 10:28:59,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:59,414 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 168 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:59,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 204 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33268 states. [2024-11-08 10:28:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33268 to 31602. [2024-11-08 10:28:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31602 states, 31601 states have (on average 1.1761653112243284) internal successors, (37168), 31601 states have internal predecessors, (37168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31602 states to 31602 states and 37168 transitions. [2024-11-08 10:28:59,797 INFO L78 Accepts]: Start accepts. Automaton has 31602 states and 37168 transitions. Word has length 239 [2024-11-08 10:28:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:59,797 INFO L471 AbstractCegarLoop]: Abstraction has 31602 states and 37168 transitions. [2024-11-08 10:28:59,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 31602 states and 37168 transitions. [2024-11-08 10:28:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 10:28:59,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:59,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:59,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:28:59,828 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:59,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash -224143076, now seen corresponding path program 1 times [2024-11-08 10:28:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424014173] [2024-11-08 10:28:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:29:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424014173] [2024-11-08 10:29:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424014173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513763447] [2024-11-08 10:29:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:00,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:00,375 INFO L87 Difference]: Start difference. First operand 31602 states and 37168 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:01,188 INFO L93 Difference]: Finished difference Result 59292 states and 69903 transitions. [2024-11-08 10:29:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:01,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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 252 [2024-11-08 10:29:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:01,226 INFO L225 Difference]: With dead ends: 59292 [2024-11-08 10:29:01,226 INFO L226 Difference]: Without dead ends: 26677 [2024-11-08 10:29:01,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:01,251 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 466 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:01,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 59 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26677 states. [2024-11-08 10:29:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26677 to 26675. [2024-11-08 10:29:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26675 states, 26674 states have (on average 1.104033890680063) internal successors, (29449), 26674 states have internal predecessors, (29449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26675 states to 26675 states and 29449 transitions. [2024-11-08 10:29:01,727 INFO L78 Accepts]: Start accepts. Automaton has 26675 states and 29449 transitions. Word has length 252 [2024-11-08 10:29:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 26675 states and 29449 transitions. [2024-11-08 10:29:01,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26675 states and 29449 transitions. [2024-11-08 10:29:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-08 10:29:01,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:01,742 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-08 10:29:01,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:29:01,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1777753653, now seen corresponding path program 1 times [2024-11-08 10:29:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81439639] [2024-11-08 10:29:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:01,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 10:29:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81439639] [2024-11-08 10:29:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81439639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597298187] [2024-11-08 10:29:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:02,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:02,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:02,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:29:02,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:29:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:02,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:02,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:29:02,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597298187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178266557] [2024-11-08 10:29:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:02,514 INFO L87 Difference]: Start difference. First operand 26675 states and 29449 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:03,085 INFO L93 Difference]: Finished difference Result 52745 states and 58257 transitions. [2024-11-08 10:29:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 272 [2024-11-08 10:29:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:03,121 INFO L225 Difference]: With dead ends: 52745 [2024-11-08 10:29:03,121 INFO L226 Difference]: Without dead ends: 26072 [2024-11-08 10:29:03,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:03,144 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 100 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:03,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 275 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26072 states. [2024-11-08 10:29:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26072 to 25863. [2024-11-08 10:29:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25863 states, 25862 states have (on average 1.0986002629340346) internal successors, (28412), 25862 states have internal predecessors, (28412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25863 states to 25863 states and 28412 transitions. [2024-11-08 10:29:03,493 INFO L78 Accepts]: Start accepts. Automaton has 25863 states and 28412 transitions. Word has length 272 [2024-11-08 10:29:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 25863 states and 28412 transitions. [2024-11-08 10:29:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25863 states and 28412 transitions. [2024-11-08 10:29:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-08 10:29:03,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:03,510 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:03,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:03,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -47643238, now seen corresponding path program 1 times [2024-11-08 10:29:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140437047] [2024-11-08 10:29:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 108 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 10:29:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140437047] [2024-11-08 10:29:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140437047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792209845] [2024-11-08 10:29:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:04,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:29:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:29:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:04,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:29:04,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:29:04,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:29:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:29:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792209845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:29:04,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:29:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-11-08 10:29:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656055042] [2024-11-08 10:29:04,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:29:04,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:29:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:04,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:29:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:04,896 INFO L87 Difference]: Start difference. First operand 25863 states and 28412 transitions. Second operand has 6 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:08,250 INFO L93 Difference]: Finished difference Result 93496 states and 103130 transitions. [2024-11-08 10:29:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:29:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 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 284 [2024-11-08 10:29:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:08,331 INFO L225 Difference]: With dead ends: 93496 [2024-11-08 10:29:08,331 INFO L226 Difference]: Without dead ends: 67229 [2024-11-08 10:29:08,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:29:08,365 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 2150 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 3930 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 3930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:08,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 448 Invalid, 4398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 3930 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 10:29:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67229 states. [2024-11-08 10:29:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67229 to 64946. [2024-11-08 10:29:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64946 states, 64945 states have (on average 1.0889675879590424) internal successors, (70723), 64945 states have internal predecessors, (70723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64946 states to 64946 states and 70723 transitions. [2024-11-08 10:29:09,369 INFO L78 Accepts]: Start accepts. Automaton has 64946 states and 70723 transitions. Word has length 284 [2024-11-08 10:29:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:09,369 INFO L471 AbstractCegarLoop]: Abstraction has 64946 states and 70723 transitions. [2024-11-08 10:29:09,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64946 states and 70723 transitions. [2024-11-08 10:29:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-08 10:29:09,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:09,395 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:29:09,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:29:09,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:29:09,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:09,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash 828076308, now seen corresponding path program 1 times [2024-11-08 10:29:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765077393] [2024-11-08 10:29:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765077393] [2024-11-08 10:29:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765077393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123155640] [2024-11-08 10:29:11,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:11,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:11,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:29:11,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:29:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:11,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:29:11,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:11,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:29:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123155640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:29:12,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:29:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2024-11-08 10:29:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326090368] [2024-11-08 10:29:12,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:29:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:29:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:29:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:29:12,375 INFO L87 Difference]: Start difference. First operand 64946 states and 70723 transitions. Second operand has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:15,535 INFO L93 Difference]: Finished difference Result 251574 states and 274121 transitions. [2024-11-08 10:29:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:29:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 6 states have internal predecessors, (583), 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 303 [2024-11-08 10:29:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:15,783 INFO L225 Difference]: With dead ends: 251574 [2024-11-08 10:29:15,783 INFO L226 Difference]: Without dead ends: 182976 [2024-11-08 10:29:15,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:29:15,862 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1556 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:15,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 492 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 10:29:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182976 states. [2024-11-08 10:29:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182976 to 121711. [2024-11-08 10:29:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121711 states, 121710 states have (on average 1.085490099416646) internal successors, (132115), 121710 states have internal predecessors, (132115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121711 states to 121711 states and 132115 transitions. [2024-11-08 10:29:18,609 INFO L78 Accepts]: Start accepts. Automaton has 121711 states and 132115 transitions. Word has length 303 [2024-11-08 10:29:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 121711 states and 132115 transitions. [2024-11-08 10:29:18,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 121711 states and 132115 transitions. [2024-11-08 10:29:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-08 10:29:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:18,669 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:18,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:29:18,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:29:18,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:18,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash 272334341, now seen corresponding path program 1 times [2024-11-08 10:29:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454338565] [2024-11-08 10:29:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 10:29:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454338565] [2024-11-08 10:29:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454338565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063484357] [2024-11-08 10:29:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:19,324 INFO L87 Difference]: Start difference. First operand 121711 states and 132115 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:20,637 INFO L93 Difference]: Finished difference Result 354949 states and 385521 transitions. [2024-11-08 10:29:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-11-08 10:29:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:20,953 INFO L225 Difference]: With dead ends: 354949 [2024-11-08 10:29:20,953 INFO L226 Difference]: Without dead ends: 233443 [2024-11-08 10:29:21,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:21,312 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 178 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:21,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 476 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:29:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233443 states. [2024-11-08 10:29:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233443 to 233401. [2024-11-08 10:29:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233401 states, 233400 states have (on average 1.0858483290488432) internal successors, (253437), 233400 states have internal predecessors, (253437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233401 states to 233401 states and 253437 transitions. [2024-11-08 10:29:25,164 INFO L78 Accepts]: Start accepts. Automaton has 233401 states and 253437 transitions. Word has length 358 [2024-11-08 10:29:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:25,164 INFO L471 AbstractCegarLoop]: Abstraction has 233401 states and 253437 transitions. [2024-11-08 10:29:25,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 233401 states and 253437 transitions. [2024-11-08 10:29:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-08 10:29:25,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:25,223 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-08 10:29:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:29:25,224 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:25,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 319777126, now seen corresponding path program 1 times [2024-11-08 10:29:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054888103] [2024-11-08 10:29:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-08 10:29:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:25,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054888103] [2024-11-08 10:29:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054888103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141376393] [2024-11-08 10:29:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:25,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:25,841 INFO L87 Difference]: Start difference. First operand 233401 states and 253437 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:27,902 INFO L93 Difference]: Finished difference Result 430548 states and 467684 transitions. [2024-11-08 10:29:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 371 [2024-11-08 10:29:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:28,178 INFO L225 Difference]: With dead ends: 430548 [2024-11-08 10:29:28,178 INFO L226 Difference]: Without dead ends: 196536 [2024-11-08 10:29:28,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:28,322 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 194 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:28,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 304 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:29:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196536 states. [2024-11-08 10:29:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196536 to 187554. [2024-11-08 10:29:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187554 states, 187553 states have (on average 1.071574434959718) internal successors, (200977), 187553 states have internal predecessors, (200977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187554 states to 187554 states and 200977 transitions. [2024-11-08 10:29:31,341 INFO L78 Accepts]: Start accepts. Automaton has 187554 states and 200977 transitions. Word has length 371 [2024-11-08 10:29:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 187554 states and 200977 transitions. [2024-11-08 10:29:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 187554 states and 200977 transitions. [2024-11-08 10:29:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-08 10:29:31,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:31,401 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:31,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:29:31,402 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 137345992, now seen corresponding path program 1 times [2024-11-08 10:29:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613872924] [2024-11-08 10:29:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613872924] [2024-11-08 10:29:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613872924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081525468] [2024-11-08 10:29:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:31,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:31,787 INFO L87 Difference]: Start difference. First operand 187554 states and 200977 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:33,462 INFO L93 Difference]: Finished difference Result 369446 states and 395140 transitions. [2024-11-08 10:29:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:33,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 377 [2024-11-08 10:29:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:33,674 INFO L225 Difference]: With dead ends: 369446 [2024-11-08 10:29:33,675 INFO L226 Difference]: Without dead ends: 171135 [2024-11-08 10:29:33,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:33,798 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 98 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:33,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 292 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:29:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171135 states. [2024-11-08 10:29:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171135 to 142028. [2024-11-08 10:29:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142028 states, 142027 states have (on average 1.0543206573398016) internal successors, (149742), 142027 states have internal predecessors, (149742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142028 states to 142028 states and 149742 transitions. [2024-11-08 10:29:36,289 INFO L78 Accepts]: Start accepts. Automaton has 142028 states and 149742 transitions. Word has length 377 [2024-11-08 10:29:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 142028 states and 149742 transitions. [2024-11-08 10:29:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 142028 states and 149742 transitions. [2024-11-08 10:29:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-08 10:29:36,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:36,311 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:36,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:29:36,311 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:36,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -981118159, now seen corresponding path program 1 times [2024-11-08 10:29:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:36,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149381331] [2024-11-08 10:29:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 10:29:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149381331] [2024-11-08 10:29:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149381331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149771408] [2024-11-08 10:29:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:37,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:37,330 INFO L87 Difference]: Start difference. First operand 142028 states and 149742 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:39,196 INFO L93 Difference]: Finished difference Result 385499 states and 406482 transitions. [2024-11-08 10:29:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 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 411 [2024-11-08 10:29:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:39,536 INFO L225 Difference]: With dead ends: 385499 [2024-11-08 10:29:39,536 INFO L226 Difference]: Without dead ends: 243067 [2024-11-08 10:29:39,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:39,608 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 565 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:39,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 301 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243067 states. [2024-11-08 10:29:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243067 to 233699. [2024-11-08 10:29:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233699 states, 233698 states have (on average 1.0553320952682521) internal successors, (246629), 233698 states have internal predecessors, (246629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233699 states to 233699 states and 246629 transitions. [2024-11-08 10:29:43,510 INFO L78 Accepts]: Start accepts. Automaton has 233699 states and 246629 transitions. Word has length 411 [2024-11-08 10:29:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:43,510 INFO L471 AbstractCegarLoop]: Abstraction has 233699 states and 246629 transitions. [2024-11-08 10:29:43,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 233699 states and 246629 transitions. [2024-11-08 10:29:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-11-08 10:29:43,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:43,540 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:29:43,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1695731600, now seen corresponding path program 1 times [2024-11-08 10:29:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121632239] [2024-11-08 10:29:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 10:29:44,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121632239] [2024-11-08 10:29:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121632239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296387586] [2024-11-08 10:29:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:44,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:44,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:44,083 INFO L87 Difference]: Start difference. First operand 233699 states and 246629 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 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)