./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label53.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 053df9010d5712277310e4ef905c5ec88d30ed5d93ad0429bc9d2f63ecfb87d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:29:22,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:29:22,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:29:22,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:29:22,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:29:22,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:29:22,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:29:22,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:29:22,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:29:22,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:29:22,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:29:22,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:29:22,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:29:22,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:29:22,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:29:22,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:29:22,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:29:22,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:29:22,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:29:22,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:29:22,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:29:22,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:29:22,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:29:22,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:29:22,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:29:22,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:29:22,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:29:22,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:29:22,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:29:22,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:29:22,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:29:22,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:29:22,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:22,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:29:22,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:29:22,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:29:22,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:29:22,588 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 -> 053df9010d5712277310e4ef905c5ec88d30ed5d93ad0429bc9d2f63ecfb87d7 [2024-11-09 19:29:22,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:29:22,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:29:22,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:29:22,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:29:22,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:29:22,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label53.c [2024-11-09 19:29:24,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:29:24,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:29:24,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c [2024-11-09 19:29:24,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794323aae/aab4a514b9e145c1863dfbc8786ca360/FLAG9f211a636 [2024-11-09 19:29:24,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794323aae/aab4a514b9e145c1863dfbc8786ca360 [2024-11-09 19:29:24,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:29:24,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:29:24,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:24,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:29:24,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:29:24,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:24" (1/1) ... [2024-11-09 19:29:24,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bed4826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:24, skipping insertion in model container [2024-11-09 19:29:24,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:24" (1/1) ... [2024-11-09 19:29:24,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:29:25,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c[4245,4258] [2024-11-09 19:29:25,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:26,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:29:26,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c[4245,4258] [2024-11-09 19:29:26,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:26,415 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:29:26,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26 WrapperNode [2024-11-09 19:29:26,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:26,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:26,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:29:26,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:29:26,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:26,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:26,791 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:29:26,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:26,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:29:26,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:29:26,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:29:26,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:26,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:26,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,049 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:29:27,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:29:27,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:29:27,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:29:27,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:29:27,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (1/1) ... [2024-11-09 19:29:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:27,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:29:27,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:29:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:29:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:29:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:29:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:29:27,476 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:29:27,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:29:32,825 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:29:32,826 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:29:32,826 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:29:33,115 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:29:33,116 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:29:33,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:29:33,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:29:33,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:33 BoogieIcfgContainer [2024-11-09 19:29:33,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:29:33,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:29:33,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:29:33,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:29:33,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:29:24" (1/3) ... [2024-11-09 19:29:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c13c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:33, skipping insertion in model container [2024-11-09 19:29:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:26" (2/3) ... [2024-11-09 19:29:33,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c13c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:33, skipping insertion in model container [2024-11-09 19:29:33,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:33" (3/3) ... [2024-11-09 19:29:33,172 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label53.c [2024-11-09 19:29:33,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:29:33,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:29:33,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:29:33,298 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;@37cfaddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:29:33,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:29:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 19:29:33,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:33,320 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] [2024-11-09 19:29:33,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -972733295, now seen corresponding path program 1 times [2024-11-09 19:29:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639421481] [2024-11-09 19:29:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639421481] [2024-11-09 19:29:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639421481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941225306] [2024-11-09 19:29:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:33,702 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:38,143 INFO L93 Difference]: Finished difference Result 2394 states and 6675 transitions. [2024-11-09 19:29:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-09 19:29:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:38,173 INFO L225 Difference]: With dead ends: 2394 [2024-11-09 19:29:38,173 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:29:38,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:38,182 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1484 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:38,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 116 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 19:29:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:29:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:29:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.7659151193633953) internal successors, (4171), 1508 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4171 transitions. [2024-11-09 19:29:38,310 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4171 transitions. Word has length 34 [2024-11-09 19:29:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 4171 transitions. [2024-11-09 19:29:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4171 transitions. [2024-11-09 19:29:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 19:29:38,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:38,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:29:38,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 756576385, now seen corresponding path program 1 times [2024-11-09 19:29:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719146464] [2024-11-09 19:29:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719146464] [2024-11-09 19:29:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719146464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:38,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669103214] [2024-11-09 19:29:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:38,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:38,726 INFO L87 Difference]: Start difference. First operand 1509 states and 4171 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:42,952 INFO L93 Difference]: Finished difference Result 4520 states and 12507 transitions. [2024-11-09 19:29:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-09 19:29:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:42,966 INFO L225 Difference]: With dead ends: 4520 [2024-11-09 19:29:42,967 INFO L226 Difference]: Without dead ends: 3013 [2024-11-09 19:29:42,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:42,970 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1414 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:42,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 479 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:29:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-11-09 19:29:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2024-11-09 19:29:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 2.479083665338645) internal successors, (7467), 3012 states have internal predecessors, (7467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 7467 transitions. [2024-11-09 19:29:43,057 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 7467 transitions. Word has length 100 [2024-11-09 19:29:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:43,058 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 7467 transitions. [2024-11-09 19:29:43,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 7467 transitions. [2024-11-09 19:29:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 19:29:43,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:43,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:29:43,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1439452551, now seen corresponding path program 1 times [2024-11-09 19:29:43,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:43,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237305286] [2024-11-09 19:29:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237305286] [2024-11-09 19:29:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237305286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:43,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303155271] [2024-11-09 19:29:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:43,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:29:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:29:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:43,394 INFO L87 Difference]: Start difference. First operand 3013 states and 7467 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:49,652 INFO L93 Difference]: Finished difference Result 9784 states and 24031 transitions. [2024-11-09 19:29:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:29:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-09 19:29:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:49,677 INFO L225 Difference]: With dead ends: 9784 [2024-11-09 19:29:49,678 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:29:49,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:49,684 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 4270 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7525 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 7525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:49,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 301 Invalid, 8355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 7525 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 19:29:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:29:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6773. [2024-11-09 19:29:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 2.382457176609569) internal successors, (16134), 6772 states have internal predecessors, (16134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 16134 transitions. [2024-11-09 19:29:49,828 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 16134 transitions. Word has length 119 [2024-11-09 19:29:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 16134 transitions. [2024-11-09 19:29:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 16134 transitions. [2024-11-09 19:29:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 19:29:49,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:49,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:49,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:29:49,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 395275665, now seen corresponding path program 1 times [2024-11-09 19:29:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336554586] [2024-11-09 19:29:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 19:29:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336554586] [2024-11-09 19:29:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336554586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:29:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151025762] [2024-11-09 19:29:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:29:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:50,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:29:50,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:29:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:50,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:29:50,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:29:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 19:29:50,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:29:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151025762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:29:50,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:29:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359069218] [2024-11-09 19:29:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:50,679 INFO L87 Difference]: Start difference. First operand 6773 states and 16134 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:54,190 INFO L93 Difference]: Finished difference Result 19560 states and 46940 transitions. [2024-11-09 19:29:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 180 [2024-11-09 19:29:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:54,233 INFO L225 Difference]: With dead ends: 19560 [2024-11-09 19:29:54,233 INFO L226 Difference]: Without dead ends: 12789 [2024-11-09 19:29:54,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:54,245 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 1340 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 4270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:54,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 498 Invalid, 4270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:29:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12789 states. [2024-11-09 19:29:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12789 to 12789. [2024-11-09 19:29:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12789 states, 12788 states have (on average 2.256959649671567) internal successors, (28862), 12788 states have internal predecessors, (28862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12789 states to 12789 states and 28862 transitions. [2024-11-09 19:29:54,496 INFO L78 Accepts]: Start accepts. Automaton has 12789 states and 28862 transitions. Word has length 180 [2024-11-09 19:29:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:54,496 INFO L471 AbstractCegarLoop]: Abstraction has 12789 states and 28862 transitions. [2024-11-09 19:29:54,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 12789 states and 28862 transitions. [2024-11-09 19:29:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 19:29:54,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:54,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:54,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:29:54,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:29:54,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash -588141111, now seen corresponding path program 1 times [2024-11-09 19:29:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323818594] [2024-11-09 19:29:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323818594] [2024-11-09 19:29:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323818594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:55,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718850692] [2024-11-09 19:29:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:55,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:29:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:29:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:55,203 INFO L87 Difference]: Start difference. First operand 12789 states and 28862 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:59,406 INFO L93 Difference]: Finished difference Result 30126 states and 67156 transitions. [2024-11-09 19:29:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:29:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2024-11-09 19:29:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:59,449 INFO L225 Difference]: With dead ends: 30126 [2024-11-09 19:29:59,449 INFO L226 Difference]: Without dead ends: 17301 [2024-11-09 19:29:59,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:59,466 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 1383 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5135 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 5401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 5135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:59,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 694 Invalid, 5401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 5135 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:29:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17301 states. [2024-11-09 19:29:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17301 to 15797. [2024-11-09 19:29:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15797 states, 15796 states have (on average 2.1898581919473283) internal successors, (34591), 15796 states have internal predecessors, (34591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 34591 transitions. [2024-11-09 19:29:59,879 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 34591 transitions. Word has length 223 [2024-11-09 19:29:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 15797 states and 34591 transitions. [2024-11-09 19:29:59,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 34591 transitions. [2024-11-09 19:29:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 19:29:59,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:59,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:59,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:29:59,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:59,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 572050237, now seen corresponding path program 1 times [2024-11-09 19:29:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74970440] [2024-11-09 19:29:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74970440] [2024-11-09 19:30:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74970440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590812306] [2024-11-09 19:30:00,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:00,141 INFO L87 Difference]: Start difference. First operand 15797 states and 34591 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:03,907 INFO L93 Difference]: Finished difference Result 39112 states and 85529 transitions. [2024-11-09 19:30:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-11-09 19:30:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:03,959 INFO L225 Difference]: With dead ends: 39112 [2024-11-09 19:30:03,959 INFO L226 Difference]: Without dead ends: 23317 [2024-11-09 19:30:03,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:03,981 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1327 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 4132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:03,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 430 Invalid, 4132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 3333 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23317 states. [2024-11-09 19:30:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23317 to 21813. [2024-11-09 19:30:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21813 states, 21812 states have (on average 2.0676691729323307) internal successors, (45100), 21812 states have internal predecessors, (45100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21813 states to 21813 states and 45100 transitions. [2024-11-09 19:30:04,440 INFO L78 Accepts]: Start accepts. Automaton has 21813 states and 45100 transitions. Word has length 229 [2024-11-09 19:30:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:04,441 INFO L471 AbstractCegarLoop]: Abstraction has 21813 states and 45100 transitions. [2024-11-09 19:30:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21813 states and 45100 transitions. [2024-11-09 19:30:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 19:30:04,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:04,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:04,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:30:04,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:04,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1883787717, now seen corresponding path program 1 times [2024-11-09 19:30:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284617672] [2024-11-09 19:30:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 11 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:30:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284617672] [2024-11-09 19:30:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284617672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509585506] [2024-11-09 19:30:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:04,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:04,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:30:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:04,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:04,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:30:04,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509585506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:30:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924283901] [2024-11-09 19:30:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:04,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:30:04,960 INFO L87 Difference]: Start difference. First operand 21813 states and 45100 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:08,750 INFO L93 Difference]: Finished difference Result 54152 states and 112743 transitions. [2024-11-09 19:30:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 248 [2024-11-09 19:30:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:08,798 INFO L225 Difference]: With dead ends: 54152 [2024-11-09 19:30:08,798 INFO L226 Difference]: Without dead ends: 33093 [2024-11-09 19:30:08,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:30:08,814 INFO L432 NwaCegarLoop]: 1863 mSDtfsCounter, 1494 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:08,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1873 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 3449 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33093 states. [2024-11-09 19:30:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33093 to 33093. [2024-11-09 19:30:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33093 states, 33092 states have (on average 2.040795358394778) internal successors, (67534), 33092 states have internal predecessors, (67534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 67534 transitions. [2024-11-09 19:30:09,201 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 67534 transitions. Word has length 248 [2024-11-09 19:30:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:09,202 INFO L471 AbstractCegarLoop]: Abstraction has 33093 states and 67534 transitions. [2024-11-09 19:30:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 67534 transitions. [2024-11-09 19:30:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-09 19:30:09,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:09,209 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:09,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:30:09,409 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,SelfDestructingSolverStorable6 [2024-11-09 19:30:09,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:09,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash -556061529, now seen corresponding path program 1 times [2024-11-09 19:30:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326874965] [2024-11-09 19:30:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-09 19:30:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326874965] [2024-11-09 19:30:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326874965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349798267] [2024-11-09 19:30:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:09,655 INFO L87 Difference]: Start difference. First operand 33093 states and 67534 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:13,399 INFO L93 Difference]: Finished difference Result 84987 states and 174639 transitions. [2024-11-09 19:30:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-11-09 19:30:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:13,488 INFO L225 Difference]: With dead ends: 84987 [2024-11-09 19:30:13,488 INFO L226 Difference]: Without dead ends: 52648 [2024-11-09 19:30:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:13,517 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1524 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3678 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 4144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 335 Invalid, 4144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3678 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:30:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52648 states. [2024-11-09 19:30:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52648 to 46629. [2024-11-09 19:30:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46629 states, 46628 states have (on average 2.0389036630350863) internal successors, (95070), 46628 states have internal predecessors, (95070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46629 states to 46629 states and 95070 transitions. [2024-11-09 19:30:14,438 INFO L78 Accepts]: Start accepts. Automaton has 46629 states and 95070 transitions. Word has length 358 [2024-11-09 19:30:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:14,439 INFO L471 AbstractCegarLoop]: Abstraction has 46629 states and 95070 transitions. [2024-11-09 19:30:14,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 46629 states and 95070 transitions. [2024-11-09 19:30:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 19:30:14,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:14,450 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:14,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1145252591, now seen corresponding path program 1 times [2024-11-09 19:30:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722705688] [2024-11-09 19:30:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 19:30:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722705688] [2024-11-09 19:30:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722705688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33481740] [2024-11-09 19:30:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:15,399 INFO L87 Difference]: Start difference. First operand 46629 states and 95070 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:19,311 INFO L93 Difference]: Finished difference Result 109800 states and 225539 transitions. [2024-11-09 19:30:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 393 [2024-11-09 19:30:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:19,540 INFO L225 Difference]: With dead ends: 109800 [2024-11-09 19:30:19,540 INFO L226 Difference]: Without dead ends: 63925 [2024-11-09 19:30:19,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:19,587 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1463 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3397 mSolverCounterSat, 1006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 3397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:19,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 145 Invalid, 4403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1006 Valid, 3397 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:30:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63925 states. [2024-11-09 19:30:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63925 to 58661. [2024-11-09 19:30:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58661 states, 58660 states have (on average 2.053017388339584) internal successors, (120430), 58660 states have internal predecessors, (120430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58661 states to 58661 states and 120430 transitions. [2024-11-09 19:30:20,732 INFO L78 Accepts]: Start accepts. Automaton has 58661 states and 120430 transitions. Word has length 393 [2024-11-09 19:30:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:20,732 INFO L471 AbstractCegarLoop]: Abstraction has 58661 states and 120430 transitions. [2024-11-09 19:30:20,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58661 states and 120430 transitions. [2024-11-09 19:30:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-09 19:30:20,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:20,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:20,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:30:20,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1633410491, now seen corresponding path program 1 times [2024-11-09 19:30:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:20,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196983397] [2024-11-09 19:30:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-09 19:30:21,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:21,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196983397] [2024-11-09 19:30:21,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196983397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:21,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101904302] [2024-11-09 19:30:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:21,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:21,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:21,320 INFO L87 Difference]: Start difference. First operand 58661 states and 120430 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:25,378 INFO L93 Difference]: Finished difference Result 145144 states and 297799 transitions. [2024-11-09 19:30:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 430 [2024-11-09 19:30:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:25,668 INFO L225 Difference]: With dead ends: 145144 [2024-11-09 19:30:25,668 INFO L226 Difference]: Without dead ends: 87237 [2024-11-09 19:30:25,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:25,728 INFO L432 NwaCegarLoop]: 1940 mSDtfsCounter, 1322 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:25,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1950 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87237 states. [2024-11-09 19:30:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87237 to 81221. [2024-11-09 19:30:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81221 states, 81220 states have (on average 2.0477591726175817) internal successors, (166319), 81220 states have internal predecessors, (166319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81221 states to 81221 states and 166319 transitions. [2024-11-09 19:30:26,998 INFO L78 Accepts]: Start accepts. Automaton has 81221 states and 166319 transitions. Word has length 430 [2024-11-09 19:30:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:26,998 INFO L471 AbstractCegarLoop]: Abstraction has 81221 states and 166319 transitions. [2024-11-09 19:30:26,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 81221 states and 166319 transitions. [2024-11-09 19:30:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-09 19:30:27,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:27,012 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:27,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:30:27,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:27,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1885869999, now seen corresponding path program 1 times [2024-11-09 19:30:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939921850] [2024-11-09 19:30:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-09 19:30:27,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939921850] [2024-11-09 19:30:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939921850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741112415] [2024-11-09 19:30:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:27,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:27,751 INFO L87 Difference]: Start difference. First operand 81221 states and 166319 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:32,120 INFO L93 Difference]: Finished difference Result 196280 states and 402926 transitions. [2024-11-09 19:30:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:32,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 433 [2024-11-09 19:30:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:32,280 INFO L225 Difference]: With dead ends: 196280 [2024-11-09 19:30:32,280 INFO L226 Difference]: Without dead ends: 115813 [2024-11-09 19:30:32,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:32,313 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 1411 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3758 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 3758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:32,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 544 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 3758 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:32,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115813 states. [2024-11-09 19:30:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115813 to 111301. [2024-11-09 19:30:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111301 states, 111300 states have (on average 2.039676549865229) internal successors, (227016), 111300 states have internal predecessors, (227016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111301 states to 111301 states and 227016 transitions. [2024-11-09 19:30:34,563 INFO L78 Accepts]: Start accepts. Automaton has 111301 states and 227016 transitions. Word has length 433 [2024-11-09 19:30:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:34,567 INFO L471 AbstractCegarLoop]: Abstraction has 111301 states and 227016 transitions. [2024-11-09 19:30:34,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 111301 states and 227016 transitions. [2024-11-09 19:30:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-09 19:30:34,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:34,583 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:34,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:30:34,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:34,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2003345169, now seen corresponding path program 1 times [2024-11-09 19:30:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433251350] [2024-11-09 19:30:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 19:30:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433251350] [2024-11-09 19:30:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433251350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124495099] [2024-11-09 19:30:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:35,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:35,107 INFO L87 Difference]: Start difference. First operand 111301 states and 227016 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:39,859 INFO L93 Difference]: Finished difference Result 257192 states and 526993 transitions. [2024-11-09 19:30:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 437 [2024-11-09 19:30:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:40,105 INFO L225 Difference]: With dead ends: 257192 [2024-11-09 19:30:40,105 INFO L226 Difference]: Without dead ends: 146645 [2024-11-09 19:30:40,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:40,165 INFO L432 NwaCegarLoop]: 1937 mSDtfsCounter, 1374 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 4203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:40,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1947 Invalid, 4203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:30:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146645 states.