./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.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 acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:04:49,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:04:49,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:04:49,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:04:49,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:04:49,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:04:49,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:04:49,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:04:49,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:04:49,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:04:49,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:04:49,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:04:49,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:04:49,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:04:49,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:04:49,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:04:49,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:04:49,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:04:49,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:04:49,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:04:49,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:04:49,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:04:49,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:04:49,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:04:49,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:04:49,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:04:49,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:04:49,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:04:49,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:04:49,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:04:49,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:04:49,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:04:49,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:04:49,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:04:49,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:04:49,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:04:49,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:04:49,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:04:49,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:04:49,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:04:49,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:04:49,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:04:49,339 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 -> acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f [2024-10-12 20:04:49,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:04:49,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:04:49,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:04:49,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:04:49,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:04:49,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2024-10-12 20:04:51,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:04:51,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:04:51,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2024-10-12 20:04:51,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd82c8f08/c677a66fb45849a1ab27d7ab16ec2e99/FLAGd480c2a1b [2024-10-12 20:04:51,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd82c8f08/c677a66fb45849a1ab27d7ab16ec2e99 [2024-10-12 20:04:51,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:04:51,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:04:51,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:04:51,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:04:51,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:04:51,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:51,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336f0f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51, skipping insertion in model container [2024-10-12 20:04:51,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:51,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:04:51,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2024-10-12 20:04:51,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:04:51,874 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:04:51,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2024-10-12 20:04:51,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:04:51,943 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:04:51,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51 WrapperNode [2024-10-12 20:04:51,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:04:51,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:04:51,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:04:51,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:04:51,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:51,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,014 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 336 [2024-10-12 20:04:52,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:04:52,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:04:52,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:04:52,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:04:52,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,048 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:04:52,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:04:52,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:04:52,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:04:52,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:04:52,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (1/1) ... [2024-10-12 20:04:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:04:52,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:52,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:04:52,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:04:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:04:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:04:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:04:52,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:04:52,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:04:52,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:04:52,690 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-12 20:04:52,690 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:04:52,737 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:04:52,738 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:04:52,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:04:52 BoogieIcfgContainer [2024-10-12 20:04:52,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:04:52,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:04:52,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:04:52,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:04:52,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:04:51" (1/3) ... [2024-10-12 20:04:52,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b055969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:04:52, skipping insertion in model container [2024-10-12 20:04:52,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:04:51" (2/3) ... [2024-10-12 20:04:52,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b055969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:04:52, skipping insertion in model container [2024-10-12 20:04:52,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:04:52" (3/3) ... [2024-10-12 20:04:52,747 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c [2024-10-12 20:04:52,759 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:04:52,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:04:52,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:04:52,816 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;@209f94f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:04:52,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:04:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.794871794871795) internal successors, (140), 79 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 20:04:52,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:52,834 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] [2024-10-12 20:04:52,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1979643945, now seen corresponding path program 1 times [2024-10-12 20:04:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333360240] [2024-10-12 20:04:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:53,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333360240] [2024-10-12 20:04:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333360240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:04:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646877313] [2024-10-12 20:04:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:04:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:04:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:04:53,133 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.794871794871795) internal successors, (140), 79 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:53,166 INFO L93 Difference]: Finished difference Result 124 states and 213 transitions. [2024-10-12 20:04:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:04:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 20:04:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:53,179 INFO L225 Difference]: With dead ends: 124 [2024-10-12 20:04:53,179 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 20:04:53,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:04:53,184 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:53,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 20:04:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-12 20:04:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.7532467532467533) internal successors, (135), 77 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions. [2024-10-12 20:04:53,217 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 20 [2024-10-12 20:04:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions. [2024-10-12 20:04:53,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions. [2024-10-12 20:04:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 20:04:53,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:53,219 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] [2024-10-12 20:04:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:04:53,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 726975449, now seen corresponding path program 1 times [2024-10-12 20:04:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907891130] [2024-10-12 20:04:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907891130] [2024-10-12 20:04:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907891130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:53,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:04:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052605073] [2024-10-12 20:04:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:53,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:04:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:04:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:04:53,429 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:53,517 INFO L93 Difference]: Finished difference Result 124 states and 207 transitions. [2024-10-12 20:04:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:04:53,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 20:04:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:53,522 INFO L225 Difference]: With dead ends: 124 [2024-10-12 20:04:53,522 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 20:04:53,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:04:53,524 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:53,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:04:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 20:04:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-12 20:04:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2024-10-12 20:04:53,534 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 20 [2024-10-12 20:04:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2024-10-12 20:04:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2024-10-12 20:04:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:04:53,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:53,537 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] [2024-10-12 20:04:53,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:04:53,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1670705904, now seen corresponding path program 1 times [2024-10-12 20:04:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673200036] [2024-10-12 20:04:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673200036] [2024-10-12 20:04:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673200036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:53,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267735931] [2024-10-12 20:04:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:53,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:53,836 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:54,186 INFO L93 Difference]: Finished difference Result 508 states and 794 transitions. [2024-10-12 20:04:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:04:54,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-12 20:04:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:54,194 INFO L225 Difference]: With dead ends: 508 [2024-10-12 20:04:54,195 INFO L226 Difference]: Without dead ends: 465 [2024-10-12 20:04:54,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:04:54,197 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 825 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:54,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1063 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:04:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-12 20:04:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 119. [2024-10-12 20:04:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2024-10-12 20:04:54,232 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 50 [2024-10-12 20:04:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:54,233 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-10-12 20:04:54,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-10-12 20:04:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:04:54,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:54,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:54,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:04:54,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:54,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash 11837336, now seen corresponding path program 1 times [2024-10-12 20:04:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535669298] [2024-10-12 20:04:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535669298] [2024-10-12 20:04:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535669298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608882384] [2024-10-12 20:04:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:54,634 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:54,830 INFO L93 Difference]: Finished difference Result 205 states and 306 transitions. [2024-10-12 20:04:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:04:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:04:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:54,833 INFO L225 Difference]: With dead ends: 205 [2024-10-12 20:04:54,833 INFO L226 Difference]: Without dead ends: 121 [2024-10-12 20:04:54,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:04:54,835 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 264 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:54,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 351 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:04:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-12 20:04:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-12 20:04:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 118 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-10-12 20:04:54,847 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 52 [2024-10-12 20:04:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:54,848 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-10-12 20:04:54,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-10-12 20:04:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:04:54,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:54,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:04:54,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 9692384, now seen corresponding path program 1 times [2024-10-12 20:04:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715482547] [2024-10-12 20:04:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:54,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715482547] [2024-10-12 20:04:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715482547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:54,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977724669] [2024-10-12 20:04:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:54,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:54,951 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:54,982 INFO L93 Difference]: Finished difference Result 276 states and 418 transitions. [2024-10-12 20:04:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:04:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:54,984 INFO L225 Difference]: With dead ends: 276 [2024-10-12 20:04:54,986 INFO L226 Difference]: Without dead ends: 192 [2024-10-12 20:04:54,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:54,987 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:54,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 158 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-12 20:04:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2024-10-12 20:04:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (276), 187 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2024-10-12 20:04:55,008 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 52 [2024-10-12 20:04:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,009 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2024-10-12 20:04:55,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2024-10-12 20:04:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:04:55,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,013 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] [2024-10-12 20:04:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:04:55,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash 352913681, now seen corresponding path program 1 times [2024-10-12 20:04:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290145105] [2024-10-12 20:04:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290145105] [2024-10-12 20:04:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290145105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:04:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536404470] [2024-10-12 20:04:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:04:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:04:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:04:55,226 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,251 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2024-10-12 20:04:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:04:55,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:04:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,253 INFO L225 Difference]: With dead ends: 194 [2024-10-12 20:04:55,253 INFO L226 Difference]: Without dead ends: 192 [2024-10-12 20:04:55,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:04:55,256 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-12 20:04:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-12 20:04:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4607329842931938) internal successors, (279), 191 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 279 transitions. [2024-10-12 20:04:55,265 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 279 transitions. Word has length 53 [2024-10-12 20:04:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 279 transitions. [2024-10-12 20:04:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 279 transitions. [2024-10-12 20:04:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:04:55,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,272 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] [2024-10-12 20:04:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:04:55,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1123356120, now seen corresponding path program 1 times [2024-10-12 20:04:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612453690] [2024-10-12 20:04:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612453690] [2024-10-12 20:04:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612453690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573175084] [2024-10-12 20:04:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,344 INFO L87 Difference]: Start difference. First operand 192 states and 279 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,366 INFO L93 Difference]: Finished difference Result 490 states and 739 transitions. [2024-10-12 20:04:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:55,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:04:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,368 INFO L225 Difference]: With dead ends: 490 [2024-10-12 20:04:55,368 INFO L226 Difference]: Without dead ends: 333 [2024-10-12 20:04:55,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,371 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-12 20:04:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2024-10-12 20:04:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.4848484848484849) internal successors, (490), 330 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 490 transitions. [2024-10-12 20:04:55,386 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 490 transitions. Word has length 54 [2024-10-12 20:04:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,386 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 490 transitions. [2024-10-12 20:04:55,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 490 transitions. [2024-10-12 20:04:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:04:55,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,387 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] [2024-10-12 20:04:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:04:55,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash 537643992, now seen corresponding path program 1 times [2024-10-12 20:04:55,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614578152] [2024-10-12 20:04:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614578152] [2024-10-12 20:04:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614578152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421546945] [2024-10-12 20:04:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,454 INFO L87 Difference]: Start difference. First operand 331 states and 490 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,479 INFO L93 Difference]: Finished difference Result 891 states and 1344 transitions. [2024-10-12 20:04:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:04:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,484 INFO L225 Difference]: With dead ends: 891 [2024-10-12 20:04:55,484 INFO L226 Difference]: Without dead ends: 595 [2024-10-12 20:04:55,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,485 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-12 20:04:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2024-10-12 20:04:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.4864864864864864) internal successors, (880), 592 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 880 transitions. [2024-10-12 20:04:55,506 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 880 transitions. Word has length 54 [2024-10-12 20:04:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,506 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 880 transitions. [2024-10-12 20:04:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 880 transitions. [2024-10-12 20:04:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:04:55,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,507 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] [2024-10-12 20:04:55,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:04:55,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1426377432, now seen corresponding path program 1 times [2024-10-12 20:04:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050384406] [2024-10-12 20:04:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050384406] [2024-10-12 20:04:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050384406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419814529] [2024-10-12 20:04:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,571 INFO L87 Difference]: Start difference. First operand 593 states and 880 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,610 INFO L93 Difference]: Finished difference Result 1645 states and 2458 transitions. [2024-10-12 20:04:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:04:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,614 INFO L225 Difference]: With dead ends: 1645 [2024-10-12 20:04:55,615 INFO L226 Difference]: Without dead ends: 1087 [2024-10-12 20:04:55,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,616 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-12 20:04:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1085. [2024-10-12 20:04:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 1.4723247232472325) internal successors, (1596), 1084 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1596 transitions. [2024-10-12 20:04:55,645 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1596 transitions. Word has length 54 [2024-10-12 20:04:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,645 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1596 transitions. [2024-10-12 20:04:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1596 transitions. [2024-10-12 20:04:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:04:55,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,646 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] [2024-10-12 20:04:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:04:55,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1163300056, now seen corresponding path program 1 times [2024-10-12 20:04:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980361315] [2024-10-12 20:04:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980361315] [2024-10-12 20:04:55,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980361315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977195292] [2024-10-12 20:04:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:55,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,710 INFO L87 Difference]: Start difference. First operand 1085 states and 1596 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,755 INFO L93 Difference]: Finished difference Result 3057 states and 4494 transitions. [2024-10-12 20:04:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:04:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,761 INFO L225 Difference]: With dead ends: 3057 [2024-10-12 20:04:55,762 INFO L226 Difference]: Without dead ends: 2007 [2024-10-12 20:04:55,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,763 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 221 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-10-12 20:04:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2005. [2024-10-12 20:04:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 2004 states have (on average 1.4471057884231537) internal successors, (2900), 2004 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2900 transitions. [2024-10-12 20:04:55,818 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2900 transitions. Word has length 54 [2024-10-12 20:04:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,818 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2900 transitions. [2024-10-12 20:04:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2900 transitions. [2024-10-12 20:04:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:04:55,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,819 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] [2024-10-12 20:04:55,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:04:55,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1854820259, now seen corresponding path program 1 times [2024-10-12 20:04:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674038822] [2024-10-12 20:04:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674038822] [2024-10-12 20:04:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674038822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:04:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700066582] [2024-10-12 20:04:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:04:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:04:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,875 INFO L87 Difference]: Start difference. First operand 2005 states and 2900 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:55,932 INFO L93 Difference]: Finished difference Result 4060 states and 5946 transitions. [2024-10-12 20:04:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:04:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-12 20:04:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,943 INFO L225 Difference]: With dead ends: 4060 [2024-10-12 20:04:55,943 INFO L226 Difference]: Without dead ends: 2937 [2024-10-12 20:04:55,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:04:55,946 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 220 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:04:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2024-10-12 20:04:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2935. [2024-10-12 20:04:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2934 states have (on average 1.4417177914110428) internal successors, (4230), 2934 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4230 transitions. [2024-10-12 20:04:56,070 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4230 transitions. Word has length 56 [2024-10-12 20:04:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 4230 transitions. [2024-10-12 20:04:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4230 transitions. [2024-10-12 20:04:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:04:56,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:56,072 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:04:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:04:56,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:56,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash -135946512, now seen corresponding path program 1 times [2024-10-12 20:04:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857266736] [2024-10-12 20:04:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:04:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857266736] [2024-10-12 20:04:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857266736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427293328] [2024-10-12 20:04:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:56,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:56,254 INFO L87 Difference]: Start difference. First operand 2935 states and 4230 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:56,715 INFO L93 Difference]: Finished difference Result 18035 states and 26044 transitions. [2024-10-12 20:04:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:04:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 72 [2024-10-12 20:04:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:56,765 INFO L225 Difference]: With dead ends: 18035 [2024-10-12 20:04:56,767 INFO L226 Difference]: Without dead ends: 15137 [2024-10-12 20:04:56,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:04:56,777 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 612 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:56,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 666 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:04:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2024-10-12 20:04:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 5831. [2024-10-12 20:04:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5831 states, 5830 states have (on average 1.4363636363636363) internal successors, (8374), 5830 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 8374 transitions. [2024-10-12 20:04:57,040 INFO L78 Accepts]: Start accepts. Automaton has 5831 states and 8374 transitions. Word has length 72 [2024-10-12 20:04:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:57,041 INFO L471 AbstractCegarLoop]: Abstraction has 5831 states and 8374 transitions. [2024-10-12 20:04:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5831 states and 8374 transitions. [2024-10-12 20:04:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:04:57,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:57,043 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:04:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:04:57,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -721658640, now seen corresponding path program 1 times [2024-10-12 20:04:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199484995] [2024-10-12 20:04:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:04:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199484995] [2024-10-12 20:04:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199484995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:57,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080522171] [2024-10-12 20:04:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:57,194 INFO L87 Difference]: Start difference. First operand 5831 states and 8374 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:57,656 INFO L93 Difference]: Finished difference Result 20931 states and 30188 transitions. [2024-10-12 20:04:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:04:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 72 [2024-10-12 20:04:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:57,708 INFO L225 Difference]: With dead ends: 20931 [2024-10-12 20:04:57,708 INFO L226 Difference]: Without dead ends: 18033 [2024-10-12 20:04:57,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:04:57,718 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 658 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:57,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 644 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:04:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18033 states. [2024-10-12 20:04:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18033 to 10183. [2024-10-12 20:04:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 10182 states have (on average 1.4289923394225104) internal successors, (14550), 10182 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14550 transitions. [2024-10-12 20:04:58,238 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14550 transitions. Word has length 72 [2024-10-12 20:04:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 10183 states and 14550 transitions. [2024-10-12 20:04:58,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14550 transitions. [2024-10-12 20:04:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:04:58,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:58,243 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:04:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:04:58,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:58,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 167074800, now seen corresponding path program 1 times [2024-10-12 20:04:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255563567] [2024-10-12 20:04:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:04:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255563567] [2024-10-12 20:04:58,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255563567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:58,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:58,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376885555] [2024-10-12 20:04:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:58,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:58,419 INFO L87 Difference]: Start difference. First operand 10183 states and 14550 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:58,918 INFO L93 Difference]: Finished difference Result 23827 states and 34332 transitions. [2024-10-12 20:04:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:04:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 72 [2024-10-12 20:04:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:58,954 INFO L225 Difference]: With dead ends: 23827 [2024-10-12 20:04:58,954 INFO L226 Difference]: Without dead ends: 20929 [2024-10-12 20:04:58,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:04:58,963 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 621 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:58,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 643 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:04:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20929 states. [2024-10-12 20:04:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20929 to 13079. [2024-10-12 20:04:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13079 states, 13078 states have (on average 1.4294234592445327) internal successors, (18694), 13078 states have internal predecessors, (18694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13079 states to 13079 states and 18694 transitions. [2024-10-12 20:04:59,413 INFO L78 Accepts]: Start accepts. Automaton has 13079 states and 18694 transitions. Word has length 72 [2024-10-12 20:04:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:59,413 INFO L471 AbstractCegarLoop]: Abstraction has 13079 states and 18694 transitions. [2024-10-12 20:04:59,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:04:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13079 states and 18694 transitions. [2024-10-12 20:04:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:04:59,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:59,415 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:04:59,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:04:59,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:59,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash -96002576, now seen corresponding path program 1 times [2024-10-12 20:04:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:59,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147276193] [2024-10-12 20:04:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:04:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147276193] [2024-10-12 20:04:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147276193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:04:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:04:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:04:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752597379] [2024-10-12 20:04:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:04:59,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:04:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:04:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:04:59,604 INFO L87 Difference]: Start difference. First operand 13079 states and 18694 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:00,236 INFO L93 Difference]: Finished difference Result 26723 states and 38476 transitions. [2024-10-12 20:05:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:00,286 INFO L225 Difference]: With dead ends: 26723 [2024-10-12 20:05:00,286 INFO L226 Difference]: Without dead ends: 23825 [2024-10-12 20:05:00,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:00,299 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 565 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:00,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 739 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2024-10-12 20:05:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 15975. [2024-10-12 20:05:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15975 states, 15974 states have (on average 1.429698259671967) internal successors, (22838), 15974 states have internal predecessors, (22838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15975 states to 15975 states and 22838 transitions. [2024-10-12 20:05:00,948 INFO L78 Accepts]: Start accepts. Automaton has 15975 states and 22838 transitions. Word has length 72 [2024-10-12 20:05:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 15975 states and 22838 transitions. [2024-10-12 20:05:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15975 states and 22838 transitions. [2024-10-12 20:05:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:05:00,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:00,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:05:00,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:00,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -863872139, now seen corresponding path program 1 times [2024-10-12 20:05:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501290114] [2024-10-12 20:05:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501290114] [2024-10-12 20:05:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501290114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140302239] [2024-10-12 20:05:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:01,109 INFO L87 Difference]: Start difference. First operand 15975 states and 22838 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:01,741 INFO L93 Difference]: Finished difference Result 27923 states and 40252 transitions. [2024-10-12 20:05:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 74 [2024-10-12 20:05:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:01,799 INFO L225 Difference]: With dead ends: 27923 [2024-10-12 20:05:01,799 INFO L226 Difference]: Without dead ends: 25873 [2024-10-12 20:05:01,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:01,809 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 608 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:01,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 758 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25873 states. [2024-10-12 20:05:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25873 to 18023. [2024-10-12 20:05:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18023 states, 18022 states have (on average 1.4323604483409167) internal successors, (25814), 18022 states have internal predecessors, (25814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18023 states to 18023 states and 25814 transitions. [2024-10-12 20:05:02,404 INFO L78 Accepts]: Start accepts. Automaton has 18023 states and 25814 transitions. Word has length 74 [2024-10-12 20:05:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:02,405 INFO L471 AbstractCegarLoop]: Abstraction has 18023 states and 25814 transitions. [2024-10-12 20:05:02,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 18023 states and 25814 transitions. [2024-10-12 20:05:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:05:02,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:02,408 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:05:02,408 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1741830520, now seen corresponding path program 1 times [2024-10-12 20:05:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825899687] [2024-10-12 20:05:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825899687] [2024-10-12 20:05:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825899687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185601213] [2024-10-12 20:05:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:02,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:02,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:02,519 INFO L87 Difference]: Start difference. First operand 18023 states and 25814 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:02,778 INFO L93 Difference]: Finished difference Result 31358 states and 45180 transitions. [2024-10-12 20:05:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:05:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:02,801 INFO L225 Difference]: With dead ends: 31358 [2024-10-12 20:05:02,802 INFO L226 Difference]: Without dead ends: 13372 [2024-10-12 20:05:02,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:02,819 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:02,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 229 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2024-10-12 20:05:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 13370. [2024-10-12 20:05:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13370 states, 13369 states have (on average 1.4356346772383872) internal successors, (19193), 13369 states have internal predecessors, (19193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13370 states to 13370 states and 19193 transitions. [2024-10-12 20:05:03,288 INFO L78 Accepts]: Start accepts. Automaton has 13370 states and 19193 transitions. Word has length 74 [2024-10-12 20:05:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:03,289 INFO L471 AbstractCegarLoop]: Abstraction has 13370 states and 19193 transitions. [2024-10-12 20:05:03,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13370 states and 19193 transitions. [2024-10-12 20:05:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:03,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:03,291 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:03,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:05:03,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:03,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash 268782275, now seen corresponding path program 1 times [2024-10-12 20:05:03,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:03,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646413869] [2024-10-12 20:05:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646413869] [2024-10-12 20:05:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646413869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514355768] [2024-10-12 20:05:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:03,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:03,400 INFO L87 Difference]: Start difference. First operand 13370 states and 19193 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:03,599 INFO L93 Difference]: Finished difference Result 20030 states and 28763 transitions. [2024-10-12 20:05:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:03,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 20:05:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:03,612 INFO L225 Difference]: With dead ends: 20030 [2024-10-12 20:05:03,612 INFO L226 Difference]: Without dead ends: 6716 [2024-10-12 20:05:03,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:03,627 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:03,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6716 states. [2024-10-12 20:05:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6716 to 6714. [2024-10-12 20:05:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6714 states, 6713 states have (on average 1.418292864591092) internal successors, (9521), 6713 states have internal predecessors, (9521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6714 states to 6714 states and 9521 transitions. [2024-10-12 20:05:03,854 INFO L78 Accepts]: Start accepts. Automaton has 6714 states and 9521 transitions. Word has length 75 [2024-10-12 20:05:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:03,854 INFO L471 AbstractCegarLoop]: Abstraction has 6714 states and 9521 transitions. [2024-10-12 20:05:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6714 states and 9521 transitions. [2024-10-12 20:05:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:03,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:03,856 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:05:03,857 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 205836241, now seen corresponding path program 1 times [2024-10-12 20:05:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325231703] [2024-10-12 20:05:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325231703] [2024-10-12 20:05:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325231703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:03,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505449032] [2024-10-12 20:05:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:03,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:03,965 INFO L87 Difference]: Start difference. First operand 6714 states and 9521 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:04,076 INFO L93 Difference]: Finished difference Result 10046 states and 14255 transitions. [2024-10-12 20:05:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:05:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:04,085 INFO L225 Difference]: With dead ends: 10046 [2024-10-12 20:05:04,085 INFO L226 Difference]: Without dead ends: 3388 [2024-10-12 20:05:04,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:04,093 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:04,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 199 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-10-12 20:05:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2024-10-12 20:05:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.3994091580502215) internal successors, (4737), 3385 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4737 transitions. [2024-10-12 20:05:04,213 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4737 transitions. Word has length 77 [2024-10-12 20:05:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 4737 transitions. [2024-10-12 20:05:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4737 transitions. [2024-10-12 20:05:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:05:04,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:04,218 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:04,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:05:04,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:04,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 608497247, now seen corresponding path program 1 times [2024-10-12 20:05:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251746284] [2024-10-12 20:05:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251746284] [2024-10-12 20:05:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251746284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:04,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071682029] [2024-10-12 20:05:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:04,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:04,338 INFO L87 Difference]: Start difference. First operand 3386 states and 4737 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:04,398 INFO L93 Difference]: Finished difference Result 5054 states and 7079 transitions. [2024-10-12 20:05:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:05:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:04,402 INFO L225 Difference]: With dead ends: 5054 [2024-10-12 20:05:04,402 INFO L226 Difference]: Without dead ends: 1724 [2024-10-12 20:05:04,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:04,406 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:04,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2024-10-12 20:05:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1722. [2024-10-12 20:05:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 1.3776873910517142) internal successors, (2371), 1721 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2371 transitions. [2024-10-12 20:05:04,486 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2371 transitions. Word has length 79 [2024-10-12 20:05:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 2371 transitions. [2024-10-12 20:05:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2371 transitions. [2024-10-12 20:05:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:05:04,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:04,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:04,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:05:04,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:04,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1265272429, now seen corresponding path program 1 times [2024-10-12 20:05:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444402375] [2024-10-12 20:05:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444402375] [2024-10-12 20:05:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444402375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369724022] [2024-10-12 20:05:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:04,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:04,575 INFO L87 Difference]: Start difference. First operand 1722 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:04,602 INFO L93 Difference]: Finished difference Result 2558 states and 3530 transitions. [2024-10-12 20:05:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:05:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:04,605 INFO L225 Difference]: With dead ends: 2558 [2024-10-12 20:05:04,605 INFO L226 Difference]: Without dead ends: 892 [2024-10-12 20:05:04,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:04,607 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:04,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-12 20:05:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 890. [2024-10-12 20:05:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.3509561304836895) internal successors, (1201), 889 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2024-10-12 20:05:04,629 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 81 [2024-10-12 20:05:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:04,630 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2024-10-12 20:05:04,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2024-10-12 20:05:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:05:04,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:04,631 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:04,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:05:04,631 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:04,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1213040645, now seen corresponding path program 1 times [2024-10-12 20:05:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185341282] [2024-10-12 20:05:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185341282] [2024-10-12 20:05:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185341282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968699400] [2024-10-12 20:05:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:05,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:05,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:05,612 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-10-12 20:05:05,614 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-10-12 20:05:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:05,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 20:05:05,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:06,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968699400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:06,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-12 20:05:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871719471] [2024-10-12 20:05:06,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 20:05:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 20:05:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:05:06,243 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand has 17 states, 17 states have (on average 13.882352941176471) internal successors, (236), 17 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:11,014 INFO L93 Difference]: Finished difference Result 6961 states and 9367 transitions. [2024-10-12 20:05:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-12 20:05:11,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.882352941176471) internal successors, (236), 17 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-12 20:05:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:11,024 INFO L225 Difference]: With dead ends: 6961 [2024-10-12 20:05:11,024 INFO L226 Difference]: Without dead ends: 6127 [2024-10-12 20:05:11,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=952, Invalid=4160, Unknown=0, NotChecked=0, Total=5112 [2024-10-12 20:05:11,028 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1817 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:11,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 632 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:05:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2024-10-12 20:05:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5989. [2024-10-12 20:05:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5989 states, 5988 states have (on average 1.2884101536406145) internal successors, (7715), 5988 states have internal predecessors, (7715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 7715 transitions. [2024-10-12 20:05:11,198 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 7715 transitions. Word has length 83 [2024-10-12 20:05:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:11,199 INFO L471 AbstractCegarLoop]: Abstraction has 5989 states and 7715 transitions. [2024-10-12 20:05:11,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.882352941176471) internal successors, (236), 17 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 7715 transitions. [2024-10-12 20:05:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:05:11,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:11,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:11,218 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-10-12 20:05:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-12 20:05:11,402 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:11,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 496195717, now seen corresponding path program 1 times [2024-10-12 20:05:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430162794] [2024-10-12 20:05:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430162794] [2024-10-12 20:05:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430162794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457225079] [2024-10-12 20:05:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:12,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:12,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:12,404 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-10-12 20:05:12,405 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-10-12 20:05:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:12,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:05:12,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:12,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457225079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:13,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2024-10-12 20:05:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965969007] [2024-10-12 20:05:13,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 20:05:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 20:05:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:05:13,774 INFO L87 Difference]: Start difference. First operand 5989 states and 7715 transitions. Second operand has 26 states, 26 states have (on average 8.384615384615385) internal successors, (218), 25 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:16,886 INFO L93 Difference]: Finished difference Result 31983 states and 41585 transitions. [2024-10-12 20:05:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-12 20:05:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.384615384615385) internal successors, (218), 25 states have internal predecessors, (218), 0 states have call successors, (0), 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 84 [2024-10-12 20:05:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:16,920 INFO L225 Difference]: With dead ends: 31983 [2024-10-12 20:05:16,920 INFO L226 Difference]: Without dead ends: 26292 [2024-10-12 20:05:16,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=915, Invalid=3915, Unknown=0, NotChecked=0, Total=4830 [2024-10-12 20:05:16,933 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2562 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:16,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 1167 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:05:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26292 states. [2024-10-12 20:05:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26292 to 25640. [2024-10-12 20:05:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25640 states, 25639 states have (on average 1.270915402316783) internal successors, (32585), 25639 states have internal predecessors, (32585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25640 states to 25640 states and 32585 transitions. [2024-10-12 20:05:17,816 INFO L78 Accepts]: Start accepts. Automaton has 25640 states and 32585 transitions. Word has length 84 [2024-10-12 20:05:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:17,817 INFO L471 AbstractCegarLoop]: Abstraction has 25640 states and 32585 transitions. [2024-10-12 20:05:17,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.384615384615385) internal successors, (218), 25 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 25640 states and 32585 transitions. [2024-10-12 20:05:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:05:17,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:17,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:17,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:05:18,020 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,SelfDestructingSolverStorable22 [2024-10-12 20:05:18,021 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:18,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2002990893, now seen corresponding path program 1 times [2024-10-12 20:05:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297905179] [2024-10-12 20:05:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297905179] [2024-10-12 20:05:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297905179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909403628] [2024-10-12 20:05:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:18,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:18,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:18,432 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-10-12 20:05:18,434 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-10-12 20:05:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:18,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-12 20:05:18,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:21,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909403628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:24,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 21] total 43 [2024-10-12 20:05:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531870312] [2024-10-12 20:05:24,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:24,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-12 20:05:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-12 20:05:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 20:05:24,674 INFO L87 Difference]: Start difference. First operand 25640 states and 32585 transitions. Second operand has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:32,485 INFO L93 Difference]: Finished difference Result 60336 states and 76628 transitions. [2024-10-12 20:05:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-12 20:05:32,485 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 states have internal predecessors, (220), 0 states have call successors, (0), 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 84 [2024-10-12 20:05:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:32,521 INFO L225 Difference]: With dead ends: 60336 [2024-10-12 20:05:32,521 INFO L226 Difference]: Without dead ends: 35825 [2024-10-12 20:05:32,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3199 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2454, Invalid=8052, Unknown=0, NotChecked=0, Total=10506 [2024-10-12 20:05:32,541 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 2361 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:32,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1588 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:05:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35825 states. [2024-10-12 20:05:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35825 to 34223. [2024-10-12 20:05:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34223 states, 34222 states have (on average 1.2595114253988662) internal successors, (43103), 34222 states have internal predecessors, (43103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 43103 transitions. [2024-10-12 20:05:33,763 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 43103 transitions. Word has length 84 [2024-10-12 20:05:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:33,764 INFO L471 AbstractCegarLoop]: Abstraction has 34223 states and 43103 transitions. [2024-10-12 20:05:33,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 43103 transitions. [2024-10-12 20:05:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:33,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:33,766 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:33,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:05:33,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:33,968 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:33,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash 489142297, now seen corresponding path program 1 times [2024-10-12 20:05:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292254421] [2024-10-12 20:05:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292254421] [2024-10-12 20:05:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292254421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713852133] [2024-10-12 20:05:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:34,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:34,419 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-10-12 20:05:34,420 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-10-12 20:05:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:34,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 20:05:34,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:35,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713852133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:35,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-12 20:05:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526836327] [2024-10-12 20:05:35,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:35,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:05:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:05:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:05:35,880 INFO L87 Difference]: Start difference. First operand 34223 states and 43103 transitions. Second operand has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 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-10-12 20:05:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:38,685 INFO L93 Difference]: Finished difference Result 81411 states and 102874 transitions. [2024-10-12 20:05:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 20:05:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 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 85 [2024-10-12 20:05:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:38,746 INFO L225 Difference]: With dead ends: 81411 [2024-10-12 20:05:38,746 INFO L226 Difference]: Without dead ends: 48216 [2024-10-12 20:05:38,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=2206, Unknown=0, NotChecked=0, Total=2756 [2024-10-12 20:05:38,779 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1461 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:38,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 1066 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:05:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48216 states. [2024-10-12 20:05:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48216 to 44115. [2024-10-12 20:05:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44115 states, 44114 states have (on average 1.2402638618125765) internal successors, (54713), 44114 states have internal predecessors, (54713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44115 states to 44115 states and 54713 transitions. [2024-10-12 20:05:40,460 INFO L78 Accepts]: Start accepts. Automaton has 44115 states and 54713 transitions. Word has length 85 [2024-10-12 20:05:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 44115 states and 54713 transitions. [2024-10-12 20:05:40,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 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-10-12 20:05:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44115 states and 54713 transitions. [2024-10-12 20:05:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:05:40,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,462 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:05:40,479 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-10-12 20:05:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:40,663 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 523007209, now seen corresponding path program 1 times [2024-10-12 20:05:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008999705] [2024-10-12 20:05:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008999705] [2024-10-12 20:05:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008999705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104401174] [2024-10-12 20:05:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:43,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:43,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:43,727 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-10-12 20:05:43,728 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-10-12 20:05:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:43,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:05:43,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:44,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104401174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:45,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:45,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10, 10] total 48 [2024-10-12 20:05:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691106225] [2024-10-12 20:05:45,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:45,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 20:05:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 20:05:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2198, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 20:05:45,786 INFO L87 Difference]: Start difference. First operand 44115 states and 54713 transitions. Second operand has 49 states, 49 states have (on average 5.081632653061225) internal successors, (249), 48 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)