./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.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_fillercode_fillercodestructure_filler-pe-cn_file-81.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 f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:27:55,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:27:55,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:27:55,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:27:55,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:27:55,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:27:55,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:27:55,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:27:55,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:27:55,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:27:55,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:27:55,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:27:55,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:27:55,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:27:55,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:27:55,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:27:55,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:27:55,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:27:55,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:27:55,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:27:55,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:27:55,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:27:55,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:27:55,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:27:55,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:27:55,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:27:55,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:27:55,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:27:55,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:27:55,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:27:55,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:27:55,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:27:55,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:27:55,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:27:55,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:27:55,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:27:55,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:27:55,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:27:55,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:27:55,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:27:55,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:27:55,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:27:55,783 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 -> f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 [2024-11-18 20:27:56,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:27:56,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:27:56,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:27:56,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:27:56,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:27:56,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2024-11-18 20:27:57,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:27:57,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:27:57,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2024-11-18 20:27:57,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5b02eee/25f9beed7d394f86b901dfadcea1be40/FLAG649580523 [2024-11-18 20:27:57,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5b02eee/25f9beed7d394f86b901dfadcea1be40 [2024-11-18 20:27:57,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:27:57,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:27:57,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:27:57,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:27:57,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:27:57,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:57" (1/1) ... [2024-11-18 20:27:57,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78752823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:57, skipping insertion in model container [2024-11-18 20:27:57,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:57" (1/1) ... [2024-11-18 20:27:57,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:27:57,992 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_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2024-11-18 20:27:58,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:27:58,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:27:58,150 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_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2024-11-18 20:27:58,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:27:58,262 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:27:58,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58 WrapperNode [2024-11-18 20:27:58,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:27:58,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:27:58,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:27:58,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:27:58,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,352 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 308 [2024-11-18 20:27:58,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:27:58,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:27:58,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:27:58,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:27:58,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,400 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-18 20:27:58,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:27:58,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:27:58,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:27:58,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:27:58,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (1/1) ... [2024-11-18 20:27:58,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:27:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:27:58,495 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-18 20:27:58,501 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-18 20:27:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:27:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:27:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:27:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:27:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:27:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:27:58,664 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:27:58,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:27:59,186 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 20:27:59,186 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:27:59,207 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:27:59,208 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:27:59,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:59 BoogieIcfgContainer [2024-11-18 20:27:59,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:27:59,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:27:59,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:27:59,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:27:59,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:27:57" (1/3) ... [2024-11-18 20:27:59,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b3afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:59, skipping insertion in model container [2024-11-18 20:27:59,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:58" (2/3) ... [2024-11-18 20:27:59,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b3afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:59, skipping insertion in model container [2024-11-18 20:27:59,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:59" (3/3) ... [2024-11-18 20:27:59,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2024-11-18 20:27:59,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:27:59,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:27:59,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:27:59,323 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;@62c79e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:27:59,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:27:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-18 20:27:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-18 20:27:59,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:27:59,346 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:27:59,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:27:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:27:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1319909153, now seen corresponding path program 1 times [2024-11-18 20:27:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:27:59,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253020027] [2024-11-18 20:27:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:27:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:27:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:27:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2024-11-18 20:27:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:27:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253020027] [2024-11-18 20:27:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253020027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:27:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663181286] [2024-11-18 20:27:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:27:59,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:27:59,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:27:59,906 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-18 20:27:59,907 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-18 20:28:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:00,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:28:00,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:28:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2024-11-18 20:28:00,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:28:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663181286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:28:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:28:00,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191509850] [2024-11-18 20:28:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:00,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:28:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:28:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:28:00,299 INFO L87 Difference]: Start difference. First operand has 134 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:28:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:00,344 INFO L93 Difference]: Finished difference Result 261 states and 474 transitions. [2024-11-18 20:28:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:28:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2024-11-18 20:28:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:00,355 INFO L225 Difference]: With dead ends: 261 [2024-11-18 20:28:00,356 INFO L226 Difference]: Without dead ends: 130 [2024-11-18 20:28:00,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 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-18 20:28:00,364 INFO L432 NwaCegarLoop]: 208 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, 208 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-18 20:28:00,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:28:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-18 20:28:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-18 20:28:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-18 20:28:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2024-11-18 20:28:00,426 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2024-11-18 20:28:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2024-11-18 20:28:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:28:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2024-11-18 20:28:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-18 20:28:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:00,448 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:00,468 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-18 20:28:00,653 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-18 20:28:00,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:00,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2109759783, now seen corresponding path program 1 times [2024-11-18 20:28:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971454259] [2024-11-18 20:28:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:01,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971454259] [2024-11-18 20:28:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971454259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:28:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362077323] [2024-11-18 20:28:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:28:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:28:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:28:01,489 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:01,827 INFO L93 Difference]: Finished difference Result 385 states and 620 transitions. [2024-11-18 20:28:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:28:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2024-11-18 20:28:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:01,833 INFO L225 Difference]: With dead ends: 385 [2024-11-18 20:28:01,834 INFO L226 Difference]: Without dead ends: 258 [2024-11-18 20:28:01,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 20:28:01,836 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 112 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:01,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 501 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:28:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-18 20:28:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-11-18 20:28:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 20:28:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2024-11-18 20:28:01,923 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2024-11-18 20:28:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:01,926 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2024-11-18 20:28:01,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2024-11-18 20:28:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:01,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:01,932 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:28:01,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1093166673, now seen corresponding path program 1 times [2024-11-18 20:28:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361688965] [2024-11-18 20:28:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361688965] [2024-11-18 20:28:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361688965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:28:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650797875] [2024-11-18 20:28:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:28:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:28:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:28:02,484 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:02,584 INFO L93 Difference]: Finished difference Result 616 states and 991 transitions. [2024-11-18 20:28:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:28:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:02,593 INFO L225 Difference]: With dead ends: 616 [2024-11-18 20:28:02,594 INFO L226 Difference]: Without dead ends: 363 [2024-11-18 20:28:02,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-18 20:28:02,598 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 77 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:02,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:28:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-18 20:28:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-11-18 20:28:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 246 states have (on average 1.4552845528455285) internal successors, (358), 248 states have internal predecessors, (358), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-18 20:28:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 574 transitions. [2024-11-18 20:28:02,672 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 574 transitions. Word has length 307 [2024-11-18 20:28:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:02,674 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 574 transitions. [2024-11-18 20:28:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 574 transitions. [2024-11-18 20:28:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:02,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:02,679 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:28:02,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1910815123, now seen corresponding path program 1 times [2024-11-18 20:28:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693057688] [2024-11-18 20:28:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693057688] [2024-11-18 20:28:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693057688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:03,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:03,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 20:28:03,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681778887] [2024-11-18 20:28:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:03,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:28:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:28:03,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:28:03,890 INFO L87 Difference]: Start difference. First operand 359 states and 574 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:28:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:04,980 INFO L93 Difference]: Finished difference Result 1237 states and 1916 transitions. [2024-11-18 20:28:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 20:28:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2024-11-18 20:28:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:04,990 INFO L225 Difference]: With dead ends: 1237 [2024-11-18 20:28:04,990 INFO L226 Difference]: Without dead ends: 881 [2024-11-18 20:28:04,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:28:04,993 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 373 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:04,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 607 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 20:28:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-18 20:28:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 387. [2024-11-18 20:28:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 270 states have (on average 1.4444444444444444) internal successors, (390), 272 states have internal predecessors, (390), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-18 20:28:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 606 transitions. [2024-11-18 20:28:05,110 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 606 transitions. Word has length 307 [2024-11-18 20:28:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 606 transitions. [2024-11-18 20:28:05,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:28:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 606 transitions. [2024-11-18 20:28:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:05,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:05,118 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:05,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:28:05,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1517788113, now seen corresponding path program 1 times [2024-11-18 20:28:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434742897] [2024-11-18 20:28:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434742897] [2024-11-18 20:28:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434742897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:15,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:15,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 20:28:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999860557] [2024-11-18 20:28:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:15,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 20:28:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 20:28:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:28:15,930 INFO L87 Difference]: Start difference. First operand 387 states and 606 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:18,924 INFO L93 Difference]: Finished difference Result 1311 states and 2074 transitions. [2024-11-18 20:28:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 20:28:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:18,934 INFO L225 Difference]: With dead ends: 1311 [2024-11-18 20:28:18,934 INFO L226 Difference]: Without dead ends: 927 [2024-11-18 20:28:18,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-18 20:28:18,938 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1237 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:18,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1147 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 20:28:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-18 20:28:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 536. [2024-11-18 20:28:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 366 states have (on average 1.4398907103825136) internal successors, (527), 368 states have internal predecessors, (527), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:28:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 843 transitions. [2024-11-18 20:28:19,048 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 843 transitions. Word has length 307 [2024-11-18 20:28:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 843 transitions. [2024-11-18 20:28:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 843 transitions. [2024-11-18 20:28:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:19,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:19,056 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:19,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:28:19,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1940489939, now seen corresponding path program 1 times [2024-11-18 20:28:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158775004] [2024-11-18 20:28:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:19,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:28,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158775004] [2024-11-18 20:28:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158775004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:28,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 20:28:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379296663] [2024-11-18 20:28:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:28,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 20:28:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 20:28:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:28:28,325 INFO L87 Difference]: Start difference. First operand 536 states and 843 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:30,946 INFO L93 Difference]: Finished difference Result 1291 states and 2047 transitions. [2024-11-18 20:28:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 20:28:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:30,954 INFO L225 Difference]: With dead ends: 1291 [2024-11-18 20:28:30,954 INFO L226 Difference]: Without dead ends: 907 [2024-11-18 20:28:30,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-18 20:28:30,957 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 942 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:30,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1148 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 20:28:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-18 20:28:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 536. [2024-11-18 20:28:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 366 states have (on average 1.4398907103825136) internal successors, (527), 368 states have internal predecessors, (527), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:28:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 843 transitions. [2024-11-18 20:28:31,030 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 843 transitions. Word has length 307 [2024-11-18 20:28:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 843 transitions. [2024-11-18 20:28:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 843 transitions. [2024-11-18 20:28:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:31,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:31,035 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:28:31,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:31,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1736642831, now seen corresponding path program 1 times [2024-11-18 20:28:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189918182] [2024-11-18 20:28:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189918182] [2024-11-18 20:28:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189918182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 20:28:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885679015] [2024-11-18 20:28:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:28:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:28:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:28:32,887 INFO L87 Difference]: Start difference. First operand 536 states and 843 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:34,507 INFO L93 Difference]: Finished difference Result 1365 states and 2175 transitions. [2024-11-18 20:28:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:28:34,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:34,514 INFO L225 Difference]: With dead ends: 1365 [2024-11-18 20:28:34,514 INFO L226 Difference]: Without dead ends: 981 [2024-11-18 20:28:34,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:28:34,517 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 638 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:34,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 937 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 20:28:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-18 20:28:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 540. [2024-11-18 20:28:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 370 states have (on average 1.4378378378378378) internal successors, (532), 372 states have internal predecessors, (532), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:28:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 848 transitions. [2024-11-18 20:28:34,586 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 848 transitions. Word has length 307 [2024-11-18 20:28:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 848 transitions. [2024-11-18 20:28:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 848 transitions. [2024-11-18 20:28:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:34,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:34,590 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:34,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 20:28:34,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:34,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1383774607, now seen corresponding path program 1 times [2024-11-18 20:28:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:34,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567590111] [2024-11-18 20:28:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567590111] [2024-11-18 20:28:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567590111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:46,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:46,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 20:28:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225202568] [2024-11-18 20:28:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:46,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 20:28:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 20:28:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:28:46,231 INFO L87 Difference]: Start difference. First operand 540 states and 848 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:49,611 INFO L93 Difference]: Finished difference Result 1314 states and 2075 transitions. [2024-11-18 20:28:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 20:28:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:49,618 INFO L225 Difference]: With dead ends: 1314 [2024-11-18 20:28:49,619 INFO L226 Difference]: Without dead ends: 930 [2024-11-18 20:28:49,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-18 20:28:49,621 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 744 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:49,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1411 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-18 20:28:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-11-18 20:28:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 543. [2024-11-18 20:28:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 373 states have (on average 1.4396782841823057) internal successors, (537), 375 states have internal predecessors, (537), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:28:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 853 transitions. [2024-11-18 20:28:49,694 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 853 transitions. Word has length 307 [2024-11-18 20:28:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 853 transitions. [2024-11-18 20:28:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 853 transitions. [2024-11-18 20:28:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:49,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:49,697 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 20:28:49,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1806476433, now seen corresponding path program 1 times [2024-11-18 20:28:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760050669] [2024-11-18 20:28:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760050669] [2024-11-18 20:28:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760050669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:56,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 20:28:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375169469] [2024-11-18 20:28:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 20:28:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 20:28:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:28:56,691 INFO L87 Difference]: Start difference. First operand 543 states and 853 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:28:58,687 INFO L93 Difference]: Finished difference Result 1221 states and 1933 transitions. [2024-11-18 20:28:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 20:28:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:28:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:28:58,695 INFO L225 Difference]: With dead ends: 1221 [2024-11-18 20:28:58,695 INFO L226 Difference]: Without dead ends: 837 [2024-11-18 20:28:58,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-18 20:28:58,698 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 400 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:28:58,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1073 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 20:28:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-18 20:28:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 542. [2024-11-18 20:28:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 372 states have (on average 1.4381720430107527) internal successors, (535), 374 states have internal predecessors, (535), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:28:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 851 transitions. [2024-11-18 20:28:58,809 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 851 transitions. Word has length 307 [2024-11-18 20:28:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:28:58,810 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 851 transitions. [2024-11-18 20:28:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:28:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 851 transitions. [2024-11-18 20:28:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:28:58,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:28:58,813 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:28:58,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 20:28:58,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:28:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:28:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1602629325, now seen corresponding path program 1 times [2024-11-18 20:28:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:28:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967869924] [2024-11-18 20:28:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:28:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:28:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:28:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:28:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:28:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967869924] [2024-11-18 20:28:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967869924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:28:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:28:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 20:28:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634189030] [2024-11-18 20:28:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:28:59,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:28:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:28:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:28:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:28:59,542 INFO L87 Difference]: Start difference. First operand 542 states and 851 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:29:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:29:00,207 INFO L93 Difference]: Finished difference Result 1073 states and 1695 transitions. [2024-11-18 20:29:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:29:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:29:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:29:00,213 INFO L225 Difference]: With dead ends: 1073 [2024-11-18 20:29:00,214 INFO L226 Difference]: Without dead ends: 689 [2024-11-18 20:29:00,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:29:00,216 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 185 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 20:29:00,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 877 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 20:29:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-18 20:29:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 540. [2024-11-18 20:29:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 370 states have (on average 1.4378378378378378) internal successors, (532), 372 states have internal predecessors, (532), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:29:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 848 transitions. [2024-11-18 20:29:00,287 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 848 transitions. Word has length 307 [2024-11-18 20:29:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:29:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 848 transitions. [2024-11-18 20:29:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:29:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 848 transitions. [2024-11-18 20:29:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-18 20:29:00,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:29:00,290 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:29:00,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 20:29:00,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:29:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:29:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1029447820, now seen corresponding path program 1 times [2024-11-18 20:29:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:29:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323222149] [2024-11-18 20:29:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:29:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:29:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:29:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:29:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:29:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323222149] [2024-11-18 20:29:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323222149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:29:07,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:29:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 20:29:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521667971] [2024-11-18 20:29:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:29:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 20:29:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:29:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 20:29:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 20:29:07,288 INFO L87 Difference]: Start difference. First operand 540 states and 848 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50)