./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/hardness-nfm22/hardness_operatoramount_amount500_file-91.i -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 44a99e37bd4c1789c639eeb1fddddb52ff04b95cd337cf1d9ec2d82c2bdc4500 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:08:37,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:08:37,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:08:37,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:08:37,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:08:37,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:08:37,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:08:37,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:08:37,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:08:37,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:08:37,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:08:37,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:08:37,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:08:37,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:08:37,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:08:37,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:08:37,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:08:37,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:08:37,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:08:37,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:08:37,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:08:37,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:08:37,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:08:37,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:08:37,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:08:37,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:08:37,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:08:37,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:08:37,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:08:37,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:08:37,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:08:37,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:08:37,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:08:37,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:08:37,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:08:37,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:08:37,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:08:37,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:08:37,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:08:37,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:08:37,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:08:37,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:08:37,585 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 -> 44a99e37bd4c1789c639eeb1fddddb52ff04b95cd337cf1d9ec2d82c2bdc4500 [2024-11-19 00:08:37,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:08:37,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:08:37,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:08:37,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:08:37,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:08:37,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i [2024-11-19 00:08:39,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:08:39,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:08:39,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i [2024-11-19 00:08:39,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d89b84f/8417c517fa01438eafe8b48b5a8abeb3/FLAG8f363d44c [2024-11-19 00:08:39,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d89b84f/8417c517fa01438eafe8b48b5a8abeb3 [2024-11-19 00:08:39,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:08:39,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:08:39,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:08:39,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:08:39,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:08:39,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:39" (1/1) ... [2024-11-19 00:08:39,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1205f93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:39, skipping insertion in model container [2024-11-19 00:08:39,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:39" (1/1) ... [2024-11-19 00:08:40,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:08:40,224 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/hardness-nfm22/hardness_operatoramount_amount500_file-91.i[916,929] [2024-11-19 00:08:40,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:08:40,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:08:40,494 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/hardness-nfm22/hardness_operatoramount_amount500_file-91.i[916,929] [2024-11-19 00:08:40,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:08:40,621 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:08:40,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40 WrapperNode [2024-11-19 00:08:40,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:08:40,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:08:40,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:08:40,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:08:40,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,755 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 807 [2024-11-19 00:08:40,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:08:40,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:08:40,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:08:40,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:08:40,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,905 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-19 00:08:40,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:08:40,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:08:40,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:08:40,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:08:40,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (1/1) ... [2024-11-19 00:08:40,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:08:41,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:08:41,024 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-19 00:08:41,027 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-19 00:08:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:08:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:08:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:08:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:08:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:08:41,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:08:41,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:08:41,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:08:42,637 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-19 00:08:42,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:08:42,665 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:08:42,668 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:08:42,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:42 BoogieIcfgContainer [2024-11-19 00:08:42,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:08:42,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:08:42,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:08:42,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:08:42,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:08:39" (1/3) ... [2024-11-19 00:08:42,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538d2eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:42, skipping insertion in model container [2024-11-19 00:08:42,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:40" (2/3) ... [2024-11-19 00:08:42,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538d2eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:42, skipping insertion in model container [2024-11-19 00:08:42,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:42" (3/3) ... [2024-11-19 00:08:42,679 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-91.i [2024-11-19 00:08:42,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:08:42,696 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:08:42,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:08:42,792 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;@75f6385e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:08:42,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:08:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 245 states have (on average 1.5510204081632653) internal successors, (380), 246 states have internal predecessors, (380), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:08:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:42,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:42,826 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:42,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1279946018, now seen corresponding path program 1 times [2024-11-19 00:08:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164655331] [2024-11-19 00:08:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164655331] [2024-11-19 00:08:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164655331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192137188] [2024-11-19 00:08:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:43,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:43,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:43,895 INFO L87 Difference]: Start difference. First operand has 314 states, 245 states have (on average 1.5510204081632653) internal successors, (380), 246 states have internal predecessors, (380), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:44,108 INFO L93 Difference]: Finished difference Result 923 states and 1646 transitions. [2024-11-19 00:08:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:44,134 INFO L225 Difference]: With dead ends: 923 [2024-11-19 00:08:44,135 INFO L226 Difference]: Without dead ends: 612 [2024-11-19 00:08:44,143 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-19 00:08:44,149 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 485 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:44,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 971 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-19 00:08:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 423. [2024-11-19 00:08:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 355 states have (on average 1.580281690140845) internal successors, (561), 355 states have internal predecessors, (561), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:08:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 693 transitions. [2024-11-19 00:08:44,267 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 693 transitions. Word has length 471 [2024-11-19 00:08:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:44,274 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 693 transitions. [2024-11-19 00:08:44,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 693 transitions. [2024-11-19 00:08:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:44,323 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:44,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 00:08:44,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1028133986, now seen corresponding path program 1 times [2024-11-19 00:08:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425285981] [2024-11-19 00:08:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425285981] [2024-11-19 00:08:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425285981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:44,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:44,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933674377] [2024-11-19 00:08:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:44,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:44,823 INFO L87 Difference]: Start difference. First operand 423 states and 693 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:44,963 INFO L93 Difference]: Finished difference Result 1255 states and 2057 transitions. [2024-11-19 00:08:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:44,974 INFO L225 Difference]: With dead ends: 1255 [2024-11-19 00:08:44,975 INFO L226 Difference]: Without dead ends: 835 [2024-11-19 00:08:44,977 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-19 00:08:44,979 INFO L432 NwaCegarLoop]: 679 mSDtfsCounter, 480 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:44,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1154 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-19 00:08:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 483. [2024-11-19 00:08:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 415 states have (on average 1.580722891566265) internal successors, (656), 415 states have internal predecessors, (656), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:08:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 788 transitions. [2024-11-19 00:08:45,039 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 788 transitions. Word has length 471 [2024-11-19 00:08:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 788 transitions. [2024-11-19 00:08:45,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 788 transitions. [2024-11-19 00:08:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:45,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:45,053 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:45,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:08:45,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash 28409890, now seen corresponding path program 1 times [2024-11-19 00:08:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:45,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525156871] [2024-11-19 00:08:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525156871] [2024-11-19 00:08:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525156871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:45,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:45,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669560927] [2024-11-19 00:08:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:45,491 INFO L87 Difference]: Start difference. First operand 483 states and 788 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:45,580 INFO L93 Difference]: Finished difference Result 1314 states and 2146 transitions. [2024-11-19 00:08:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:45,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:45,598 INFO L225 Difference]: With dead ends: 1314 [2024-11-19 00:08:45,598 INFO L226 Difference]: Without dead ends: 834 [2024-11-19 00:08:45,603 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-19 00:08:45,604 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 300 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:45,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1218 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-19 00:08:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 831. [2024-11-19 00:08:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 732 states have (on average 1.5860655737704918) internal successors, (1161), 733 states have internal predecessors, (1161), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:08:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1353 transitions. [2024-11-19 00:08:45,681 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1353 transitions. Word has length 471 [2024-11-19 00:08:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1353 transitions. [2024-11-19 00:08:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1353 transitions. [2024-11-19 00:08:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:45,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:45,696 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:08:45,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash -862039966, now seen corresponding path program 1 times [2024-11-19 00:08:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802089204] [2024-11-19 00:08:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:46,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802089204] [2024-11-19 00:08:46,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802089204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:46,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96713220] [2024-11-19 00:08:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:46,064 INFO L87 Difference]: Start difference. First operand 831 states and 1353 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:46,143 INFO L93 Difference]: Finished difference Result 2455 states and 3997 transitions. [2024-11-19 00:08:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:46,155 INFO L225 Difference]: With dead ends: 2455 [2024-11-19 00:08:46,155 INFO L226 Difference]: Without dead ends: 1627 [2024-11-19 00:08:46,160 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-19 00:08:46,162 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 479 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:46,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:08:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-19 00:08:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 835. [2024-11-19 00:08:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 736 states have (on average 1.5828804347826086) internal successors, (1165), 737 states have internal predecessors, (1165), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:08:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1357 transitions. [2024-11-19 00:08:46,229 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1357 transitions. Word has length 471 [2024-11-19 00:08:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:46,231 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1357 transitions. [2024-11-19 00:08:46,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1357 transitions. [2024-11-19 00:08:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:46,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:46,241 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:46,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:08:46,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:46,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1587560164, now seen corresponding path program 1 times [2024-11-19 00:08:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359989532] [2024-11-19 00:08:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359989532] [2024-11-19 00:08:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359989532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444600984] [2024-11-19 00:08:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:46,602 INFO L87 Difference]: Start difference. First operand 835 states and 1357 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:46,732 INFO L93 Difference]: Finished difference Result 2432 states and 3950 transitions. [2024-11-19 00:08:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:46,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:46,741 INFO L225 Difference]: With dead ends: 2432 [2024-11-19 00:08:46,742 INFO L226 Difference]: Without dead ends: 1600 [2024-11-19 00:08:46,744 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-19 00:08:46,745 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 339 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:46,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1199 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-19 00:08:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1597. [2024-11-19 00:08:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1432 states have (on average 1.5768156424581006) internal successors, (2258), 1435 states have internal predecessors, (2258), 160 states have call successors, (160), 4 states have call predecessors, (160), 4 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-19 00:08:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2578 transitions. [2024-11-19 00:08:46,811 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2578 transitions. Word has length 471 [2024-11-19 00:08:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:46,813 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2578 transitions. [2024-11-19 00:08:46,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2578 transitions. [2024-11-19 00:08:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:46,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:46,823 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:46,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:08:46,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:46,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -253426336, now seen corresponding path program 1 times [2024-11-19 00:08:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113666235] [2024-11-19 00:08:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113666235] [2024-11-19 00:08:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113666235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:48,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:08:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364248536] [2024-11-19 00:08:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:48,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:08:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:48,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:08:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:08:48,062 INFO L87 Difference]: Start difference. First operand 1597 states and 2578 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:48,446 INFO L93 Difference]: Finished difference Result 4971 states and 7971 transitions. [2024-11-19 00:08:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:08:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:48,469 INFO L225 Difference]: With dead ends: 4971 [2024-11-19 00:08:48,469 INFO L226 Difference]: Without dead ends: 3377 [2024-11-19 00:08:48,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-19 00:08:48,477 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 574 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:48,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1469 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:08:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2024-11-19 00:08:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2859. [2024-11-19 00:08:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2566 states have (on average 1.5666406858924395) internal successors, (4020), 2573 states have internal predecessors, (4020), 284 states have call successors, (284), 8 states have call predecessors, (284), 8 states have return successors, (284), 277 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-19 00:08:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4588 transitions. [2024-11-19 00:08:48,658 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4588 transitions. Word has length 471 [2024-11-19 00:08:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:48,659 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4588 transitions. [2024-11-19 00:08:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4588 transitions. [2024-11-19 00:08:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:48,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:48,672 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:08:48,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 99662046, now seen corresponding path program 1 times [2024-11-19 00:08:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786098027] [2024-11-19 00:08:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786098027] [2024-11-19 00:08:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786098027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:08:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083140068] [2024-11-19 00:08:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:08:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:08:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:08:50,405 INFO L87 Difference]: Start difference. First operand 2859 states and 4588 transitions. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:54,917 INFO L93 Difference]: Finished difference Result 18456 states and 29548 transitions. [2024-11-19 00:08:54,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:08:54,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2024-11-19 00:08:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:54,987 INFO L225 Difference]: With dead ends: 18456 [2024-11-19 00:08:54,988 INFO L226 Difference]: Without dead ends: 15600 [2024-11-19 00:08:54,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2024-11-19 00:08:55,000 INFO L432 NwaCegarLoop]: 999 mSDtfsCounter, 2942 mSDsluCounter, 5912 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 6911 SdHoareTripleChecker+Invalid, 3793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:55,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 6911 Invalid, 3793 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [253 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 00:08:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15600 states. [2024-11-19 00:08:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15600 to 11101. [2024-11-19 00:08:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11101 states, 10263 states have (on average 1.5805320081847414) internal successors, (16221), 10293 states have internal predecessors, (16221), 798 states have call successors, (798), 39 states have call predecessors, (798), 39 states have return successors, (798), 768 states have call predecessors, (798), 798 states have call successors, (798) [2024-11-19 00:08:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11101 states to 11101 states and 17817 transitions. [2024-11-19 00:08:55,550 INFO L78 Accepts]: Start accepts. Automaton has 11101 states and 17817 transitions. Word has length 471 [2024-11-19 00:08:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:55,551 INFO L471 AbstractCegarLoop]: Abstraction has 11101 states and 17817 transitions. [2024-11-19 00:08:55,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:08:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 11101 states and 17817 transitions. [2024-11-19 00:08:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-19 00:08:55,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:55,568 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:08:55,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:55,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash -381418212, now seen corresponding path program 1 times [2024-11-19 00:08:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413393085] [2024-11-19 00:08:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:56,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413393085] [2024-11-19 00:08:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413393085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:56,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:56,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:08:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153990952] [2024-11-19 00:08:56,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:56,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:08:56,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:56,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:08:56,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:08:56,597 INFO L87 Difference]: Start difference. First operand 11101 states and 17817 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:08:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:57,731 INFO L93 Difference]: Finished difference Result 33626 states and 53961 transitions. [2024-11-19 00:08:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:08:57,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 471 [2024-11-19 00:08:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:57,798 INFO L225 Difference]: With dead ends: 33626 [2024-11-19 00:08:57,799 INFO L226 Difference]: Without dead ends: 22583 [2024-11-19 00:08:57,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:08:57,828 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 727 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:57,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2586 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:08:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22583 states. [2024-11-19 00:08:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22583 to 16959. [2024-11-19 00:08:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16959 states, 15651 states have (on average 1.581815858411603) internal successors, (24757), 15695 states have internal predecessors, (24757), 1250 states have call successors, (1250), 57 states have call predecessors, (1250), 57 states have return successors, (1250), 1206 states have call predecessors, (1250), 1250 states have call successors, (1250) [2024-11-19 00:08:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16959 states to 16959 states and 27257 transitions. [2024-11-19 00:08:58,663 INFO L78 Accepts]: Start accepts. Automaton has 16959 states and 27257 transitions. Word has length 471 [2024-11-19 00:08:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:58,664 INFO L471 AbstractCegarLoop]: Abstraction has 16959 states and 27257 transitions. [2024-11-19 00:08:58,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:08:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 16959 states and 27257 transitions. [2024-11-19 00:08:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-19 00:08:58,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:58,688 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:08:58,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:08:58,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:58,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash 372262624, now seen corresponding path program 1 times [2024-11-19 00:08:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935940026] [2024-11-19 00:08:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:08:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935940026] [2024-11-19 00:08:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935940026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:08:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835420126] [2024-11-19 00:08:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:59,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:08:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:08:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:08:59,378 INFO L87 Difference]: Start difference. First operand 16959 states and 27257 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:00,102 INFO L93 Difference]: Finished difference Result 44213 states and 71033 transitions. [2024-11-19 00:09:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2024-11-19 00:09:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:00,180 INFO L225 Difference]: With dead ends: 44213 [2024-11-19 00:09:00,180 INFO L226 Difference]: Without dead ends: 27312 [2024-11-19 00:09:00,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-19 00:09:00,229 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 438 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:00,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1470 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27312 states. [2024-11-19 00:09:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27312 to 17020. [2024-11-19 00:09:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17020 states, 15677 states have (on average 1.5808509281112457) internal successors, (24783), 15720 states have internal predecessors, (24783), 1284 states have call successors, (1284), 58 states have call predecessors, (1284), 58 states have return successors, (1284), 1241 states have call predecessors, (1284), 1284 states have call successors, (1284) [2024-11-19 00:09:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 27351 transitions. [2024-11-19 00:09:01,012 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 27351 transitions. Word has length 472 [2024-11-19 00:09:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:01,013 INFO L471 AbstractCegarLoop]: Abstraction has 17020 states and 27351 transitions. [2024-11-19 00:09:01,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 27351 transitions. [2024-11-19 00:09:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-19 00:09:01,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:01,036 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:09:01,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2016301406, now seen corresponding path program 1 times [2024-11-19 00:09:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883149062] [2024-11-19 00:09:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883149062] [2024-11-19 00:09:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883149062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:02,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:02,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:09:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372082128] [2024-11-19 00:09:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:02,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:09:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:09:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:09:02,828 INFO L87 Difference]: Start difference. First operand 17020 states and 27351 transitions. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:04,586 INFO L93 Difference]: Finished difference Result 47855 states and 76618 transitions. [2024-11-19 00:09:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:09:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2024-11-19 00:09:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:04,674 INFO L225 Difference]: With dead ends: 47855 [2024-11-19 00:09:04,674 INFO L226 Difference]: Without dead ends: 36812 [2024-11-19 00:09:04,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:09:04,711 INFO L432 NwaCegarLoop]: 906 mSDtfsCounter, 1466 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 6274 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:04,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 6274 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 00:09:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36812 states. [2024-11-19 00:09:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36812 to 27374. [2024-11-19 00:09:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27374 states, 25667 states have (on average 1.5852651264269295) internal successors, (40689), 25741 states have internal predecessors, (40689), 1616 states have call successors, (1616), 90 states have call predecessors, (1616), 90 states have return successors, (1616), 1542 states have call predecessors, (1616), 1616 states have call successors, (1616) [2024-11-19 00:09:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27374 states to 27374 states and 43921 transitions. [2024-11-19 00:09:05,618 INFO L78 Accepts]: Start accepts. Automaton has 27374 states and 43921 transitions. Word has length 472 [2024-11-19 00:09:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:05,619 INFO L471 AbstractCegarLoop]: Abstraction has 27374 states and 43921 transitions. [2024-11-19 00:09:05,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 27374 states and 43921 transitions. [2024-11-19 00:09:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-19 00:09:05,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:05,656 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:05,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:09:05,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:05,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1091320474, now seen corresponding path program 1 times [2024-11-19 00:09:05,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:05,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690273734] [2024-11-19 00:09:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690273734] [2024-11-19 00:09:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690273734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810394969] [2024-11-19 00:09:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:06,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:06,327 INFO L87 Difference]: Start difference. First operand 27374 states and 43921 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:07,167 INFO L93 Difference]: Finished difference Result 58201 states and 93272 transitions. [2024-11-19 00:09:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2024-11-19 00:09:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:07,258 INFO L225 Difference]: With dead ends: 58201 [2024-11-19 00:09:07,258 INFO L226 Difference]: Without dead ends: 30946 [2024-11-19 00:09:07,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 00:09:07,321 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 501 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:07,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1975 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30946 states. [2024-11-19 00:09:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30946 to 30940. [2024-11-19 00:09:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30940 states, 28760 states have (on average 1.576008344923505) internal successors, (45326), 28858 states have internal predecessors, (45326), 2062 states have call successors, (2062), 117 states have call predecessors, (2062), 117 states have return successors, (2062), 1964 states have call predecessors, (2062), 2062 states have call successors, (2062) [2024-11-19 00:09:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30940 states to 30940 states and 49450 transitions. [2024-11-19 00:09:08,424 INFO L78 Accepts]: Start accepts. Automaton has 30940 states and 49450 transitions. Word has length 472 [2024-11-19 00:09:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:08,425 INFO L471 AbstractCegarLoop]: Abstraction has 30940 states and 49450 transitions. [2024-11-19 00:09:08,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30940 states and 49450 transitions. [2024-11-19 00:09:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-19 00:09:08,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:08,460 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:08,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:09:08,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 198883302, now seen corresponding path program 1 times [2024-11-19 00:09:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768390303] [2024-11-19 00:09:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:09,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768390303] [2024-11-19 00:09:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768390303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:09:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739723562] [2024-11-19 00:09:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:09:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:09:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:09:09,975 INFO L87 Difference]: Start difference. First operand 30940 states and 49450 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:11,196 INFO L93 Difference]: Finished difference Result 61879 states and 98810 transitions. [2024-11-19 00:09:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:09:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2024-11-19 00:09:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:11,284 INFO L225 Difference]: With dead ends: 61879 [2024-11-19 00:09:11,284 INFO L226 Difference]: Without dead ends: 31062 [2024-11-19 00:09:11,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:09:11,333 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 644 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:11,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2614 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:09:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31062 states. [2024-11-19 00:09:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31062 to 25813. [2024-11-19 00:09:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25813 states, 24066 states have (on average 1.566857807695504) internal successors, (37708), 24138 states have internal predecessors, (37708), 1636 states have call successors, (1636), 110 states have call predecessors, (1636), 110 states have return successors, (1636), 1564 states have call predecessors, (1636), 1636 states have call successors, (1636) [2024-11-19 00:09:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25813 states to 25813 states and 40980 transitions. [2024-11-19 00:09:12,502 INFO L78 Accepts]: Start accepts. Automaton has 25813 states and 40980 transitions. Word has length 472 [2024-11-19 00:09:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:12,503 INFO L471 AbstractCegarLoop]: Abstraction has 25813 states and 40980 transitions. [2024-11-19 00:09:12,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25813 states and 40980 transitions. [2024-11-19 00:09:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-19 00:09:12,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:12,524 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:12,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:09:12,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1387721439, now seen corresponding path program 1 times [2024-11-19 00:09:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623458285] [2024-11-19 00:09:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623458285] [2024-11-19 00:09:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623458285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:13,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880220275] [2024-11-19 00:09:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:13,757 INFO L87 Difference]: Start difference. First operand 25813 states and 40980 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:15,168 INFO L93 Difference]: Finished difference Result 62306 states and 98644 transitions. [2024-11-19 00:09:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2024-11-19 00:09:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:15,250 INFO L225 Difference]: With dead ends: 62306 [2024-11-19 00:09:15,250 INFO L226 Difference]: Without dead ends: 35128 [2024-11-19 00:09:15,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-19 00:09:15,282 INFO L432 NwaCegarLoop]: 684 mSDtfsCounter, 605 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:15,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1763 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:09:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35128 states. [2024-11-19 00:09:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35128 to 24113. [2024-11-19 00:09:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24113 states, 22823 states have (on average 1.57739999123691) internal successors, (36001), 22869 states have internal predecessors, (36001), 1204 states have call successors, (1204), 85 states have call predecessors, (1204), 85 states have return successors, (1204), 1158 states have call predecessors, (1204), 1204 states have call successors, (1204) [2024-11-19 00:09:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24113 states to 24113 states and 38409 transitions. [2024-11-19 00:09:16,213 INFO L78 Accepts]: Start accepts. Automaton has 24113 states and 38409 transitions. Word has length 473 [2024-11-19 00:09:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:16,214 INFO L471 AbstractCegarLoop]: Abstraction has 24113 states and 38409 transitions. [2024-11-19 00:09:16,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24113 states and 38409 transitions. [2024-11-19 00:09:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-19 00:09:16,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:16,236 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:16,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:09:16,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1102097317, now seen corresponding path program 1 times [2024-11-19 00:09:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103536946] [2024-11-19 00:09:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103536946] [2024-11-19 00:09:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103536946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:17,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871994420] [2024-11-19 00:09:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:17,579 INFO L87 Difference]: Start difference. First operand 24113 states and 38409 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:19,424 INFO L93 Difference]: Finished difference Result 76967 states and 122157 transitions. [2024-11-19 00:09:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:19,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2024-11-19 00:09:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:19,554 INFO L225 Difference]: With dead ends: 76967 [2024-11-19 00:09:19,554 INFO L226 Difference]: Without dead ends: 52881 [2024-11-19 00:09:19,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-19 00:09:19,601 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 750 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:19,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1546 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52881 states. [2024-11-19 00:09:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52881 to 24269. [2024-11-19 00:09:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24269 states, 22979 states have (on average 1.5768745376213065) internal successors, (36235), 23025 states have internal predecessors, (36235), 1204 states have call successors, (1204), 85 states have call predecessors, (1204), 85 states have return successors, (1204), 1158 states have call predecessors, (1204), 1204 states have call successors, (1204) [2024-11-19 00:09:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 38643 transitions. [2024-11-19 00:09:20,985 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 38643 transitions. Word has length 473 [2024-11-19 00:09:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:20,988 INFO L471 AbstractCegarLoop]: Abstraction has 24269 states and 38643 transitions. [2024-11-19 00:09:20,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 38643 transitions. [2024-11-19 00:09:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-19 00:09:21,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:21,006 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:21,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:09:21,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1830407582, now seen corresponding path program 1 times [2024-11-19 00:09:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677321993] [2024-11-19 00:09:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677321993] [2024-11-19 00:09:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677321993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026512404] [2024-11-19 00:09:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:22,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:22,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:22,016 INFO L87 Difference]: Start difference. First operand 24269 states and 38643 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:23,456 INFO L93 Difference]: Finished difference Result 58689 states and 93187 transitions. [2024-11-19 00:09:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2024-11-19 00:09:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:23,532 INFO L225 Difference]: With dead ends: 58689 [2024-11-19 00:09:23,532 INFO L226 Difference]: Without dead ends: 34555 [2024-11-19 00:09:23,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-19 00:09:23,561 INFO L432 NwaCegarLoop]: 855 mSDtfsCounter, 492 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:23,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1846 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34555 states. [2024-11-19 00:09:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34555 to 25405. [2024-11-19 00:09:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25405 states, 24115 states have (on average 1.560978643997512) internal successors, (37643), 24161 states have internal predecessors, (37643), 1204 states have call successors, (1204), 85 states have call predecessors, (1204), 85 states have return successors, (1204), 1158 states have call predecessors, (1204), 1204 states have call successors, (1204) [2024-11-19 00:09:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25405 states to 25405 states and 40051 transitions. [2024-11-19 00:09:24,405 INFO L78 Accepts]: Start accepts. Automaton has 25405 states and 40051 transitions. Word has length 473 [2024-11-19 00:09:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:24,406 INFO L471 AbstractCegarLoop]: Abstraction has 25405 states and 40051 transitions. [2024-11-19 00:09:24,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:09:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25405 states and 40051 transitions. [2024-11-19 00:09:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-19 00:09:24,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:24,429 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:24,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:09:24,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 415171872, now seen corresponding path program 1 times [2024-11-19 00:09:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051153817] [2024-11-19 00:09:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:09:30,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051153817] [2024-11-19 00:09:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051153817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:30,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 00:09:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439419807] [2024-11-19 00:09:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:30,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:09:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:09:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:09:30,806 INFO L87 Difference]: Start difference. First operand 25405 states and 40051 transitions. Second operand has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:09:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:35,715 INFO L93 Difference]: Finished difference Result 63477 states and 99750 transitions. [2024-11-19 00:09:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:09:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 473 [2024-11-19 00:09:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:35,798 INFO L225 Difference]: With dead ends: 63477 [2024-11-19 00:09:35,799 INFO L226 Difference]: Without dead ends: 47545 [2024-11-19 00:09:35,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:09:35,830 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 4834 mSDsluCounter, 4772 mSDsCounter, 0 mSdLazyCounter, 3190 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4834 SdHoareTripleChecker+Valid, 5214 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 3190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:35,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4834 Valid, 5214 Invalid, 3501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 3190 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 00:09:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47545 states. [2024-11-19 00:09:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47545 to 27101. [2024-11-19 00:09:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27101 states, 25811 states have (on average 1.5634419433574833) internal successors, (40354), 25857 states have internal predecessors, (40354), 1204 states have call successors, (1204), 85 states have call predecessors, (1204), 85 states have return successors, (1204), 1158 states have call predecessors, (1204), 1204 states have call successors, (1204) [2024-11-19 00:09:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27101 states to 27101 states and 42762 transitions. [2024-11-19 00:09:36,670 INFO L78 Accepts]: Start accepts. Automaton has 27101 states and 42762 transitions. Word has length 473 [2024-11-19 00:09:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 27101 states and 42762 transitions. [2024-11-19 00:09:36,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:09:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27101 states and 42762 transitions. [2024-11-19 00:09:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-19 00:09:36,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:36,695 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:09:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:09:36,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1273771870, now seen corresponding path program 1 times [2024-11-19 00:09:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509430020] [2024-11-19 00:09:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat