./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.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-60.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 b17bfee826ea574d9167da2b4a5bf955c821c1f041af44a4ed8a7abf38eb1376 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:05:27,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:05:27,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:05:27,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:05:27,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:05:27,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:05:27,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:05:27,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:05:27,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:05:27,194 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:05:27,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:05:27,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:05:27,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:05:27,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:05:27,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:05:27,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:05:27,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:05:27,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:05:27,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:05:27,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:05:27,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:05:27,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:05:27,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:05:27,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:05:27,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:05:27,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:05:27,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:05:27,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:05:27,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:05:27,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:05:27,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:05:27,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:05:27,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:27,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:05:27,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:05:27,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:05:27,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:05:27,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:05:27,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:05:27,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:05:27,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:05:27,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:05:27,207 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 -> b17bfee826ea574d9167da2b4a5bf955c821c1f041af44a4ed8a7abf38eb1376 [2024-11-19 00:05:27,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:05:27,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:05:27,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:05:27,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:05:27,555 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:05:27,559 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-60.i [2024-11-19 00:05:29,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:05:29,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:05:29,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.i [2024-11-19 00:05:29,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b9f4562/679b2751bbea42e6b6e007ed01776fe0/FLAG93b759802 [2024-11-19 00:05:29,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b9f4562/679b2751bbea42e6b6e007ed01776fe0 [2024-11-19 00:05:29,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:05:29,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:05:29,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:29,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:05:29,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:05:29,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:29" (1/1) ... [2024-11-19 00:05:29,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70071353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:29, skipping insertion in model container [2024-11-19 00:05:29,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:29" (1/1) ... [2024-11-19 00:05:29,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:05:29,741 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-60.i[916,929] [2024-11-19 00:05:30,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:30,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:05:30,078 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-60.i[916,929] [2024-11-19 00:05:30,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:30,282 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:05:30,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30 WrapperNode [2024-11-19 00:05:30,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:30,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:30,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:05:30,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:05:30,295 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:05:30" (1/1) ... [2024-11-19 00:05:30,323 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:05:30" (1/1) ... [2024-11-19 00:05:30,434 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 815 [2024-11-19 00:05:30,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:30,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:05:30,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:05:30,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:05:30,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,594 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:05:30,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:05:30,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:05:30,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:05:30,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:05:30,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (1/1) ... [2024-11-19 00:05:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:30,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:30,791 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:05:30,796 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:05:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:05:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:05:30,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:05:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:05:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:05:30,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:05:31,022 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:05:31,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:05:32,602 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-19 00:05:32,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:05:32,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:05:32,631 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:05:32,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:32 BoogieIcfgContainer [2024-11-19 00:05:32,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:05:32,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:05:32,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:05:32,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:05:32,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:05:29" (1/3) ... [2024-11-19 00:05:32,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d05e488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:32, skipping insertion in model container [2024-11-19 00:05:32,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:30" (2/3) ... [2024-11-19 00:05:32,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d05e488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:32, skipping insertion in model container [2024-11-19 00:05:32,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:32" (3/3) ... [2024-11-19 00:05:32,641 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-60.i [2024-11-19 00:05:32,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:05:32,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:05:32,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:05:32,768 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;@67bb0b0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:05:32,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:05:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 328 states, 258 states have (on average 1.565891472868217) internal successors, (404), 259 states have internal predecessors, (404), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 00:05:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-11-19 00:05:32,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:32,811 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 142976052, now seen corresponding path program 1 times [2024-11-19 00:05:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20194303] [2024-11-19 00:05:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2024-11-19 00:05:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20194303] [2024-11-19 00:05:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20194303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:05:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912817049] [2024-11-19 00:05:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:05:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:33,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:05:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:05:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:34,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:05:34,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:05:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2024-11-19 00:05:34,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:05:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912817049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:34,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:05:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:05:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608462159] [2024-11-19 00:05:34,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:05:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:05:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:34,160 INFO L87 Difference]: Start difference. First operand has 328 states, 258 states have (on average 1.565891472868217) internal successors, (404), 259 states have internal predecessors, (404), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2024-11-19 00:05:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:34,226 INFO L93 Difference]: Finished difference Result 649 states and 1137 transitions. [2024-11-19 00:05:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:05:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 489 [2024-11-19 00:05:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:34,241 INFO L225 Difference]: With dead ends: 649 [2024-11-19 00:05:34,242 INFO L226 Difference]: Without dead ends: 324 [2024-11-19 00:05:34,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:34,252 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:34,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-19 00:05:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-19 00:05:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 255 states have (on average 1.5490196078431373) internal successors, (395), 255 states have internal predecessors, (395), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 00:05:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 529 transitions. [2024-11-19 00:05:34,339 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 529 transitions. Word has length 489 [2024-11-19 00:05:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:34,339 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 529 transitions. [2024-11-19 00:05:34,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2024-11-19 00:05:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 529 transitions. [2024-11-19 00:05:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:34,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:34,351 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:34,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:05:34,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:05:34,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1863349437, now seen corresponding path program 1 times [2024-11-19 00:05:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450096284] [2024-11-19 00:05:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:35,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450096284] [2024-11-19 00:05:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450096284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007465308] [2024-11-19 00:05:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:35,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:35,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:35,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:35,131 INFO L87 Difference]: Start difference. First operand 324 states and 529 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:35,362 INFO L93 Difference]: Finished difference Result 883 states and 1441 transitions. [2024-11-19 00:05:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:35,373 INFO L225 Difference]: With dead ends: 883 [2024-11-19 00:05:35,374 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 00:05:35,379 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:05:35,381 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 378 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:35,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1079 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 00:05:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2024-11-19 00:05:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 466 states have (on average 1.5622317596566524) internal successors, (728), 467 states have internal predecessors, (728), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 00:05:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 908 transitions. [2024-11-19 00:05:35,459 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 908 transitions. Word has length 490 [2024-11-19 00:05:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:35,463 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 908 transitions. [2024-11-19 00:05:35,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 908 transitions. [2024-11-19 00:05:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:35,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:35,505 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:35,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:05:35,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash -556207039, now seen corresponding path program 1 times [2024-11-19 00:05:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008696485] [2024-11-19 00:05:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:35,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:35,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008696485] [2024-11-19 00:05:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008696485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:35,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565686858] [2024-11-19 00:05:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:35,982 INFO L87 Difference]: Start difference. First operand 559 states and 908 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:36,098 INFO L93 Difference]: Finished difference Result 1659 states and 2696 transitions. [2024-11-19 00:05:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:36,119 INFO L225 Difference]: With dead ends: 1659 [2024-11-19 00:05:36,121 INFO L226 Difference]: Without dead ends: 1103 [2024-11-19 00:05:36,123 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:05:36,124 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 514 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:36,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1040 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-19 00:05:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 561. [2024-11-19 00:05:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 468 states have (on average 1.5598290598290598) internal successors, (730), 469 states have internal predecessors, (730), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 00:05:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 910 transitions. [2024-11-19 00:05:36,193 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 910 transitions. Word has length 490 [2024-11-19 00:05:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 910 transitions. [2024-11-19 00:05:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 910 transitions. [2024-11-19 00:05:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:36,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:36,203 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:05:36,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 282826623, now seen corresponding path program 1 times [2024-11-19 00:05:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982844934] [2024-11-19 00:05:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982844934] [2024-11-19 00:05:36,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982844934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:36,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:36,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144458665] [2024-11-19 00:05:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:36,995 INFO L87 Difference]: Start difference. First operand 561 states and 910 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:37,052 INFO L93 Difference]: Finished difference Result 1123 states and 1823 transitions. [2024-11-19 00:05:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:37,058 INFO L225 Difference]: With dead ends: 1123 [2024-11-19 00:05:37,059 INFO L226 Difference]: Without dead ends: 565 [2024-11-19 00:05:37,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:37,063 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:37,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-19 00:05:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-19 00:05:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 472 states have (on average 1.555084745762712) internal successors, (734), 473 states have internal predecessors, (734), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 00:05:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 914 transitions. [2024-11-19 00:05:37,111 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 914 transitions. Word has length 490 [2024-11-19 00:05:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:37,115 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 914 transitions. [2024-11-19 00:05:37,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 914 transitions. [2024-11-19 00:05:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:37,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:37,121 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:05:37,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -134569983, now seen corresponding path program 1 times [2024-11-19 00:05:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939000688] [2024-11-19 00:05:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939000688] [2024-11-19 00:05:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939000688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:38,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:05:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156942361] [2024-11-19 00:05:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:05:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:05:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:38,076 INFO L87 Difference]: Start difference. First operand 565 states and 914 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:39,029 INFO L93 Difference]: Finished difference Result 3062 states and 4956 transitions. [2024-11-19 00:05:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:05:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:39,045 INFO L225 Difference]: With dead ends: 3062 [2024-11-19 00:05:39,046 INFO L226 Difference]: Without dead ends: 2500 [2024-11-19 00:05:39,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:05:39,050 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 1819 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:39,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 3392 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:05:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2024-11-19 00:05:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2082. [2024-11-19 00:05:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 1817 states have (on average 1.5718216840946615) internal successors, (2856), 1823 states have internal predecessors, (2856), 256 states have call successors, (256), 8 states have call predecessors, (256), 8 states have return successors, (256), 250 states have call predecessors, (256), 256 states have call successors, (256) [2024-11-19 00:05:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3368 transitions. [2024-11-19 00:05:39,235 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3368 transitions. Word has length 490 [2024-11-19 00:05:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:39,237 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3368 transitions. [2024-11-19 00:05:39,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3368 transitions. [2024-11-19 00:05:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:39,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:39,245 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:05:39,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1191301185, now seen corresponding path program 1 times [2024-11-19 00:05:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186193982] [2024-11-19 00:05:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186193982] [2024-11-19 00:05:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186193982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:40,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20083055] [2024-11-19 00:05:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:40,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:40,458 INFO L87 Difference]: Start difference. First operand 2082 states and 3368 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:40,963 INFO L93 Difference]: Finished difference Result 4701 states and 7559 transitions. [2024-11-19 00:05:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:40,981 INFO L225 Difference]: With dead ends: 4701 [2024-11-19 00:05:40,982 INFO L226 Difference]: Without dead ends: 2622 [2024-11-19 00:05:40,990 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:05:40,993 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 809 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:40,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1705 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:05:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2024-11-19 00:05:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2078. [2024-11-19 00:05:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1813 states have (on average 1.5686707115278544) internal successors, (2844), 1819 states have internal predecessors, (2844), 256 states have call successors, (256), 8 states have call predecessors, (256), 8 states have return successors, (256), 250 states have call predecessors, (256), 256 states have call successors, (256) [2024-11-19 00:05:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3356 transitions. [2024-11-19 00:05:41,126 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 3356 transitions. Word has length 490 [2024-11-19 00:05:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:41,127 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 3356 transitions. [2024-11-19 00:05:41,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 3356 transitions. [2024-11-19 00:05:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:41,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:41,135 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:41,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:05:41,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2024392703, now seen corresponding path program 1 times [2024-11-19 00:05:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421947831] [2024-11-19 00:05:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421947831] [2024-11-19 00:05:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421947831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603393666] [2024-11-19 00:05:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:42,343 INFO L87 Difference]: Start difference. First operand 2078 states and 3356 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:42,443 INFO L93 Difference]: Finished difference Result 4157 states and 6717 transitions. [2024-11-19 00:05:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:42,457 INFO L225 Difference]: With dead ends: 4157 [2024-11-19 00:05:42,457 INFO L226 Difference]: Without dead ends: 2082 [2024-11-19 00:05:42,462 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:05:42,463 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:42,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2024-11-19 00:05:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2024-11-19 00:05:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 1817 states have (on average 1.5674188222344525) internal successors, (2848), 1823 states have internal predecessors, (2848), 256 states have call successors, (256), 8 states have call predecessors, (256), 8 states have return successors, (256), 250 states have call predecessors, (256), 256 states have call successors, (256) [2024-11-19 00:05:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3360 transitions. [2024-11-19 00:05:42,582 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3360 transitions. Word has length 490 [2024-11-19 00:05:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:42,583 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3360 transitions. [2024-11-19 00:05:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3360 transitions. [2024-11-19 00:05:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:42,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:42,590 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:05:42,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:42,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2106544319, now seen corresponding path program 1 times [2024-11-19 00:05:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808594066] [2024-11-19 00:05:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808594066] [2024-11-19 00:05:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808594066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:42,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:42,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547874615] [2024-11-19 00:05:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:42,873 INFO L87 Difference]: Start difference. First operand 2082 states and 3360 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:43,023 INFO L93 Difference]: Finished difference Result 4229 states and 6820 transitions. [2024-11-19 00:05:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:43,039 INFO L225 Difference]: With dead ends: 4229 [2024-11-19 00:05:43,039 INFO L226 Difference]: Without dead ends: 2150 [2024-11-19 00:05:43,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:43,047 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 364 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1010 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2024-11-19 00:05:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1606. [2024-11-19 00:05:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1427 states have (on average 1.5893482831114225) internal successors, (2268), 1429 states have internal predecessors, (2268), 172 states have call successors, (172), 6 states have call predecessors, (172), 6 states have return successors, (172), 170 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-19 00:05:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2612 transitions. [2024-11-19 00:05:43,148 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2612 transitions. Word has length 490 [2024-11-19 00:05:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2612 transitions. [2024-11-19 00:05:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2612 transitions. [2024-11-19 00:05:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:43,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:43,156 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:43,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:05:43,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:43,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash -997513603, now seen corresponding path program 1 times [2024-11-19 00:05:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406071582] [2024-11-19 00:05:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406071582] [2024-11-19 00:05:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406071582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594197251] [2024-11-19 00:05:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:44,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:44,283 INFO L87 Difference]: Start difference. First operand 1606 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:44,603 INFO L93 Difference]: Finished difference Result 5021 states and 8175 transitions. [2024-11-19 00:05:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:44,622 INFO L225 Difference]: With dead ends: 5021 [2024-11-19 00:05:44,622 INFO L226 Difference]: Without dead ends: 3418 [2024-11-19 00:05:44,628 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:05:44,630 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 530 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:44,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1439 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2024-11-19 00:05:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 2786. [2024-11-19 00:05:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2583 states have (on average 1.6167247386759582) internal successors, (4176), 2589 states have internal predecessors, (4176), 192 states have call successors, (192), 10 states have call predecessors, (192), 10 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-19 00:05:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 4560 transitions. [2024-11-19 00:05:44,775 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 4560 transitions. Word has length 490 [2024-11-19 00:05:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:44,776 INFO L471 AbstractCegarLoop]: Abstraction has 2786 states and 4560 transitions. [2024-11-19 00:05:44,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 4560 transitions. [2024-11-19 00:05:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:44,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:44,785 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:05:44,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:44,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash 540826427, now seen corresponding path program 1 times [2024-11-19 00:05:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530884169] [2024-11-19 00:05:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530884169] [2024-11-19 00:05:45,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530884169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:45,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:45,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:45,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455139161] [2024-11-19 00:05:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:45,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:45,706 INFO L87 Difference]: Start difference. First operand 2786 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:45,888 INFO L93 Difference]: Finished difference Result 7728 states and 12610 transitions. [2024-11-19 00:05:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:45,917 INFO L225 Difference]: With dead ends: 7728 [2024-11-19 00:05:45,917 INFO L226 Difference]: Without dead ends: 4945 [2024-11-19 00:05:45,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:05:45,927 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 379 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:45,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1044 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2024-11-19 00:05:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4863. [2024-11-19 00:05:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4458 states have (on average 1.6002691790040378) internal successors, (7134), 4470 states have internal predecessors, (7134), 384 states have call successors, (384), 20 states have call predecessors, (384), 20 states have return successors, (384), 372 states have call predecessors, (384), 384 states have call successors, (384) [2024-11-19 00:05:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 7902 transitions. [2024-11-19 00:05:46,206 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 7902 transitions. Word has length 490 [2024-11-19 00:05:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:46,207 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 7902 transitions. [2024-11-19 00:05:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 7902 transitions. [2024-11-19 00:05:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:46,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:46,222 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:05:46,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1509444869, now seen corresponding path program 1 times [2024-11-19 00:05:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017063574] [2024-11-19 00:05:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017063574] [2024-11-19 00:05:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017063574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:47,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:05:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619418579] [2024-11-19 00:05:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:47,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:05:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:05:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:47,995 INFO L87 Difference]: Start difference. First operand 4863 states and 7902 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:48,698 INFO L93 Difference]: Finished difference Result 18089 states and 29236 transitions. [2024-11-19 00:05:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:48,781 INFO L225 Difference]: With dead ends: 18089 [2024-11-19 00:05:48,781 INFO L226 Difference]: Without dead ends: 13229 [2024-11-19 00:05:48,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:48,801 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 676 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:48,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2362 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:05:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13229 states. [2024-11-19 00:05:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13229 to 5979. [2024-11-19 00:05:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5979 states, 5574 states have (on average 1.6092572658772875) internal successors, (8970), 5586 states have internal predecessors, (8970), 384 states have call successors, (384), 20 states have call predecessors, (384), 20 states have return successors, (384), 372 states have call predecessors, (384), 384 states have call successors, (384) [2024-11-19 00:05:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 9738 transitions. [2024-11-19 00:05:49,183 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 9738 transitions. Word has length 490 [2024-11-19 00:05:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:49,184 INFO L471 AbstractCegarLoop]: Abstraction has 5979 states and 9738 transitions. [2024-11-19 00:05:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 9738 transitions. [2024-11-19 00:05:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:49,195 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:05:49,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1191394561, now seen corresponding path program 1 times [2024-11-19 00:05:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230472569] [2024-11-19 00:05:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:50,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230472569] [2024-11-19 00:05:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230472569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:05:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829998488] [2024-11-19 00:05:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:50,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:05:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:05:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:50,673 INFO L87 Difference]: Start difference. First operand 5979 states and 9738 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:51,416 INFO L93 Difference]: Finished difference Result 15927 states and 25920 transitions. [2024-11-19 00:05:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:51,445 INFO L225 Difference]: With dead ends: 15927 [2024-11-19 00:05:51,445 INFO L226 Difference]: Without dead ends: 9951 [2024-11-19 00:05:51,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:05:51,463 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 441 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:51,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1924 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:05:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2024-11-19 00:05:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 6177. [2024-11-19 00:05:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6177 states, 5702 states have (on average 1.6032970887407927) internal successors, (9142), 5714 states have internal predecessors, (9142), 451 states have call successors, (451), 23 states have call predecessors, (451), 23 states have return successors, (451), 439 states have call predecessors, (451), 451 states have call successors, (451) [2024-11-19 00:05:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 10044 transitions. [2024-11-19 00:05:51,777 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 10044 transitions. Word has length 490 [2024-11-19 00:05:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 6177 states and 10044 transitions. [2024-11-19 00:05:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 10044 transitions. [2024-11-19 00:05:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:51,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:51,789 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:05:51,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1628077579, now seen corresponding path program 1 times [2024-11-19 00:05:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378154533] [2024-11-19 00:05:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378154533] [2024-11-19 00:05:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378154533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327713670] [2024-11-19 00:05:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:52,974 INFO L87 Difference]: Start difference. First operand 6177 states and 10044 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:53,467 INFO L93 Difference]: Finished difference Result 22944 states and 37400 transitions. [2024-11-19 00:05:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:53,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:53,512 INFO L225 Difference]: With dead ends: 22944 [2024-11-19 00:05:53,512 INFO L226 Difference]: Without dead ends: 16128 [2024-11-19 00:05:53,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:05:53,535 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 1418 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:53,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1898 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16128 states. [2024-11-19 00:05:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16128 to 8201. [2024-11-19 00:05:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 7726 states have (on average 1.6158426093709553) internal successors, (12484), 7738 states have internal predecessors, (12484), 451 states have call successors, (451), 23 states have call predecessors, (451), 23 states have return successors, (451), 439 states have call predecessors, (451), 451 states have call successors, (451) [2024-11-19 00:05:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 13386 transitions. [2024-11-19 00:05:54,020 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 13386 transitions. Word has length 490 [2024-11-19 00:05:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 8201 states and 13386 transitions. [2024-11-19 00:05:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 13386 transitions. [2024-11-19 00:05:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-19 00:05:54,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:54,036 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:05:54,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -422193717, now seen corresponding path program 1 times [2024-11-19 00:05:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878693362] [2024-11-19 00:05:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:05:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878693362] [2024-11-19 00:05:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878693362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:05:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292684219] [2024-11-19 00:05:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:55,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:05:55,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:55,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:05:55,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:55,160 INFO L87 Difference]: Start difference. First operand 8201 states and 13386 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:56,520 INFO L93 Difference]: Finished difference Result 18042 states and 29478 transitions. [2024-11-19 00:05:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:05:56,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2024-11-19 00:05:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:56,549 INFO L225 Difference]: With dead ends: 18042 [2024-11-19 00:05:56,549 INFO L226 Difference]: Without dead ends: 10042 [2024-11-19 00:05:56,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:05:56,569 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 2058 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:56,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3444 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:05:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10042 states. [2024-11-19 00:05:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10042 to 8205. [2024-11-19 00:05:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8205 states, 7729 states have (on average 1.6135334454651313) internal successors, (12471), 7741 states have internal predecessors, (12471), 451 states have call successors, (451), 24 states have call predecessors, (451), 24 states have return successors, (451), 439 states have call predecessors, (451), 451 states have call successors, (451) [2024-11-19 00:05:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8205 states to 8205 states and 13373 transitions. [2024-11-19 00:05:56,920 INFO L78 Accepts]: Start accepts. Automaton has 8205 states and 13373 transitions. Word has length 490 [2024-11-19 00:05:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:56,921 INFO L471 AbstractCegarLoop]: Abstraction has 8205 states and 13373 transitions. [2024-11-19 00:05:56,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:05:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8205 states and 13373 transitions. [2024-11-19 00:05:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-19 00:05:56,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:56,935 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:05:56,935 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash -674711531, now seen corresponding path program 1 times [2024-11-19 00:05:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468765654] [2024-11-19 00:05:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:06:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468765654] [2024-11-19 00:06:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468765654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:06:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154814742] [2024-11-19 00:06:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:00,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:06:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:06:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:06:00,094 INFO L87 Difference]: Start difference. First operand 8205 states and 13373 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:02,367 INFO L93 Difference]: Finished difference Result 24821 states and 40426 transitions. [2024-11-19 00:06:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:06:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2024-11-19 00:06:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:02,414 INFO L225 Difference]: With dead ends: 24821 [2024-11-19 00:06:02,414 INFO L226 Difference]: Without dead ends: 16821 [2024-11-19 00:06:02,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:06:02,440 INFO L432 NwaCegarLoop]: 1377 mSDtfsCounter, 1851 mSDsluCounter, 2843 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 4220 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:02,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 4220 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 00:06:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16821 states. [2024-11-19 00:06:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16821 to 14095. [2024-11-19 00:06:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14095 states, 13333 states have (on average 1.6131403285082127) internal successors, (21508), 13355 states have internal predecessors, (21508), 719 states have call successors, (719), 42 states have call predecessors, (719), 42 states have return successors, (719), 697 states have call predecessors, (719), 719 states have call successors, (719) [2024-11-19 00:06:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14095 states to 14095 states and 22946 transitions. [2024-11-19 00:06:03,013 INFO L78 Accepts]: Start accepts. Automaton has 14095 states and 22946 transitions. Word has length 491 [2024-11-19 00:06:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:03,014 INFO L471 AbstractCegarLoop]: Abstraction has 14095 states and 22946 transitions. [2024-11-19 00:06:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 14095 states and 22946 transitions. [2024-11-19 00:06:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-19 00:06:03,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:03,037 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:06:03,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:03,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1641445745, now seen corresponding path program 1 times [2024-11-19 00:06:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:03,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754134200] [2024-11-19 00:06:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:06:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754134200] [2024-11-19 00:06:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754134200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:03,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:03,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:06:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382723224] [2024-11-19 00:06:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:03,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:06:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:06:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:06:03,492 INFO L87 Difference]: Start difference. First operand 14095 states and 22946 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:03,783 INFO L93 Difference]: Finished difference Result 27934 states and 45505 transitions. [2024-11-19 00:06:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:06:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2024-11-19 00:06:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:03,831 INFO L225 Difference]: With dead ends: 27934 [2024-11-19 00:06:03,831 INFO L226 Difference]: Without dead ends: 14095 [2024-11-19 00:06:03,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:06:03,859 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:03,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1051 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:06:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14095 states. [2024-11-19 00:06:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14095 to 14095. [2024-11-19 00:06:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14095 states, 13333 states have (on average 1.6113402835070876) internal successors, (21484), 13355 states have internal predecessors, (21484), 719 states have call successors, (719), 42 states have call predecessors, (719), 42 states have return successors, (719), 697 states have call predecessors, (719), 719 states have call successors, (719) [2024-11-19 00:06:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14095 states to 14095 states and 22922 transitions. [2024-11-19 00:06:04,354 INFO L78 Accepts]: Start accepts. Automaton has 14095 states and 22922 transitions. Word has length 491 [2024-11-19 00:06:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:04,355 INFO L471 AbstractCegarLoop]: Abstraction has 14095 states and 22922 transitions. [2024-11-19 00:06:04,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14095 states and 22922 transitions. [2024-11-19 00:06:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-19 00:06:04,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:04,377 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:06:04,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 584714543, now seen corresponding path program 1 times [2024-11-19 00:06:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920352385] [2024-11-19 00:06:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:06:05,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:05,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920352385] [2024-11-19 00:06:05,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920352385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:05,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:05,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:06:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86053892] [2024-11-19 00:06:05,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:05,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:06:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:06:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:06:05,567 INFO L87 Difference]: Start difference. First operand 14095 states and 22922 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:06,058 INFO L93 Difference]: Finished difference Result 19647 states and 31961 transitions. [2024-11-19 00:06:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:06:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2024-11-19 00:06:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:06,105 INFO L225 Difference]: With dead ends: 19647 [2024-11-19 00:06:06,105 INFO L226 Difference]: Without dead ends: 17566 [2024-11-19 00:06:06,121 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:06:06,122 INFO L432 NwaCegarLoop]: 1030 mSDtfsCounter, 705 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:06,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2203 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:06:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2024-11-19 00:06:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13151. [2024-11-19 00:06:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13151 states, 12471 states have (on average 1.613503327720311) internal successors, (20122), 12483 states have internal predecessors, (20122), 641 states have call successors, (641), 38 states have call predecessors, (641), 38 states have return successors, (641), 629 states have call predecessors, (641), 641 states have call successors, (641) [2024-11-19 00:06:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13151 states to 13151 states and 21404 transitions. [2024-11-19 00:06:06,565 INFO L78 Accepts]: Start accepts. Automaton has 13151 states and 21404 transitions. Word has length 491 [2024-11-19 00:06:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:06,566 INFO L471 AbstractCegarLoop]: Abstraction has 13151 states and 21404 transitions. [2024-11-19 00:06:06,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2024-11-19 00:06:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13151 states and 21404 transitions. [2024-11-19 00:06:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-19 00:06:06,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:06,585 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:06:06,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:06,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1056070893, now seen corresponding path program 1 times [2024-11-19 00:06:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149928092] [2024-11-19 00:06:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2024-11-19 00:06:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149928092] [2024-11-19 00:06:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149928092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-19 00:06:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832820913] [2024-11-19 00:06:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 00:06:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 00:06:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:06:14,514 INFO L87 Difference]: Start difference. First operand 13151 states and 21404 transitions. Second operand has 22 states, 22 states have (on average 7.2272727272727275) internal successors, (159), 22 states have internal predecessors, (159), 6 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67)