./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.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 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:04:23,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:04:23,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:04:23,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:04:23,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:04:23,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:04:23,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:04:23,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:04:23,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:04:23,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:04:23,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:04:23,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:04:23,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:04:23,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:04:23,686 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:04:23,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:04:23,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:04:23,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:04:23,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:04:23,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:04:23,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:04:23,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:04:23,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:04:23,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:04:23,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:04:23,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:04:23,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:04:23,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:04:23,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:04:23,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:04:23,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:04:23,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:04:23,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:04:23,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:04:23,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:04:23,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:04:23,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:04:23,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:04:23,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:04:23,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:04:23,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:04:23,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:04:23,695 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 -> 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 [2024-11-19 00:04:23,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:04:24,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:04:24,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:04:24,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:04:24,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:04:24,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2024-11-19 00:04:25,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:04:26,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:04:26,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2024-11-19 00:04:26,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2402a260/6cf5bea6695f46abac73ec48c73c2db9/FLAG99bda819f [2024-11-19 00:04:26,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2402a260/6cf5bea6695f46abac73ec48c73c2db9 [2024-11-19 00:04:26,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:04:26,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:04:26,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:04:26,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:04:26,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:04:26,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:26,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1586fb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26, skipping insertion in model container [2024-11-19 00:04:26,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:26,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:04:26,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i[916,929] [2024-11-19 00:04:26,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:04:26,633 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:04:26,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i[916,929] [2024-11-19 00:04:26,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:04:26,823 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:04:26,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26 WrapperNode [2024-11-19 00:04:26,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:04:26,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:04:26,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:04:26,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:04:26,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:26,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:26,997 INFO L138 Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 784 [2024-11-19 00:04:26,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:04:26,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:04:26,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:04:26,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:04:27,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,209 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:04:27,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:04:27,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:04:27,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:04:27,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:04:27,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (1/1) ... [2024-11-19 00:04:27,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:04:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:27,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:04:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:04:27,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:04:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:04:27,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:04:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:04:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:04:27,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:04:27,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:04:27,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:04:29,112 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-19 00:04:29,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:04:29,147 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:04:29,147 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:04:29,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:29 BoogieIcfgContainer [2024-11-19 00:04:29,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:04:29,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:04:29,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:04:29,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:04:29,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:04:26" (1/3) ... [2024-11-19 00:04:29,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b1ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:29, skipping insertion in model container [2024-11-19 00:04:29,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:26" (2/3) ... [2024-11-19 00:04:29,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b1ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:29, skipping insertion in model container [2024-11-19 00:04:29,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:29" (3/3) ... [2024-11-19 00:04:29,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-49.i [2024-11-19 00:04:29,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:04:29,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:04:29,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:04:29,283 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;@740c2f03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:04:29,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:04:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 218 states have (on average 1.5137614678899083) internal successors, (330), 219 states have internal predecessors, (330), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 00:04:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:29,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:29,331 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:29,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:29,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1335054292, now seen corresponding path program 1 times [2024-11-19 00:04:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:29,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128695283] [2024-11-19 00:04:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2024-11-19 00:04:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128695283] [2024-11-19 00:04:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128695283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:04:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485076955] [2024-11-19 00:04:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:04:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:30,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:04:30,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:04:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:30,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:04:30,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:04:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2024-11-19 00:04:30,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:04:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485076955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:30,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:04:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:04:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819288811] [2024-11-19 00:04:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:30,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:04:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:04:30,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:04:30,891 INFO L87 Difference]: Start difference. First operand has 312 states, 218 states have (on average 1.5137614678899083) internal successors, (330), 219 states have internal predecessors, (330), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2024-11-19 00:04:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:30,962 INFO L93 Difference]: Finished difference Result 612 states and 1101 transitions. [2024-11-19 00:04:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:04:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) Word has length 596 [2024-11-19 00:04:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:30,980 INFO L225 Difference]: With dead ends: 612 [2024-11-19 00:04:30,980 INFO L226 Difference]: Without dead ends: 303 [2024-11-19 00:04:30,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:04:30,990 INFO L432 NwaCegarLoop]: 494 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, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:30,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:04:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-19 00:04:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-11-19 00:04:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 210 states have internal predecessors, (312), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 00:04:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 494 transitions. [2024-11-19 00:04:31,073 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 494 transitions. Word has length 596 [2024-11-19 00:04:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:31,074 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 494 transitions. [2024-11-19 00:04:31,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2024-11-19 00:04:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 494 transitions. [2024-11-19 00:04:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:31,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:31,092 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:31,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:04:31,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:04:31,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1063081046, now seen corresponding path program 1 times [2024-11-19 00:04:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427587595] [2024-11-19 00:04:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427587595] [2024-11-19 00:04:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427587595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498477355] [2024-11-19 00:04:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:31,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:31,941 INFO L87 Difference]: Start difference. First operand 303 states and 494 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:32,123 INFO L93 Difference]: Finished difference Result 892 states and 1455 transitions. [2024-11-19 00:04:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2024-11-19 00:04:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:32,140 INFO L225 Difference]: With dead ends: 892 [2024-11-19 00:04:32,142 INFO L226 Difference]: Without dead ends: 592 [2024-11-19 00:04:32,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:32,145 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 468 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:32,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 947 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-19 00:04:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 370. [2024-11-19 00:04:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 277 states have (on average 1.5306859205776173) internal successors, (424), 277 states have internal predecessors, (424), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 00:04:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 606 transitions. [2024-11-19 00:04:32,231 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 606 transitions. Word has length 596 [2024-11-19 00:04:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:32,234 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 606 transitions. [2024-11-19 00:04:32,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 606 transitions. [2024-11-19 00:04:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:32,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:32,255 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:32,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:04:32,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:32,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1624334474, now seen corresponding path program 1 times [2024-11-19 00:04:32,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:32,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838287550] [2024-11-19 00:04:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838287550] [2024-11-19 00:04:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838287550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:32,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:32,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349441322] [2024-11-19 00:04:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:32,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:32,852 INFO L87 Difference]: Start difference. First operand 370 states and 606 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:32,956 INFO L93 Difference]: Finished difference Result 922 states and 1511 transitions. [2024-11-19 00:04:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:32,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2024-11-19 00:04:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:32,963 INFO L225 Difference]: With dead ends: 922 [2024-11-19 00:04:32,963 INFO L226 Difference]: Without dead ends: 555 [2024-11-19 00:04:32,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:32,966 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 201 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:32,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 950 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-19 00:04:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2024-11-19 00:04:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 455 states have (on average 1.5626373626373626) internal successors, (711), 456 states have internal predecessors, (711), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-19 00:04:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 899 transitions. [2024-11-19 00:04:33,006 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 899 transitions. Word has length 596 [2024-11-19 00:04:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:33,008 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 899 transitions. [2024-11-19 00:04:33,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 899 transitions. [2024-11-19 00:04:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:33,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:33,022 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:33,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:04:33,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash -284123316, now seen corresponding path program 1 times [2024-11-19 00:04:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523031447] [2024-11-19 00:04:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523031447] [2024-11-19 00:04:33,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523031447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:33,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536811871] [2024-11-19 00:04:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:33,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:33,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:33,554 INFO L87 Difference]: Start difference. First operand 552 states and 899 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:33,667 INFO L93 Difference]: Finished difference Result 1650 states and 2691 transitions. [2024-11-19 00:04:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2024-11-19 00:04:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:33,682 INFO L225 Difference]: With dead ends: 1650 [2024-11-19 00:04:33,682 INFO L226 Difference]: Without dead ends: 1101 [2024-11-19 00:04:33,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:33,685 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 475 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:33,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 966 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-19 00:04:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2024-11-19 00:04:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 906 states have (on average 1.5430463576158941) internal successors, (1398), 908 states have internal predecessors, (1398), 188 states have call successors, (188), 4 states have call predecessors, (188), 4 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-19 00:04:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1774 transitions. [2024-11-19 00:04:33,814 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1774 transitions. Word has length 596 [2024-11-19 00:04:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1774 transitions. [2024-11-19 00:04:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1774 transitions. [2024-11-19 00:04:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:33,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:33,829 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:33,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:04:33,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:33,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 196956942, now seen corresponding path program 1 times [2024-11-19 00:04:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954798049] [2024-11-19 00:04:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954798049] [2024-11-19 00:04:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954798049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:34,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:34,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076191244] [2024-11-19 00:04:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:34,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:34,996 INFO L87 Difference]: Start difference. First operand 1099 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:35,166 INFO L93 Difference]: Finished difference Result 3291 states and 5316 transitions. [2024-11-19 00:04:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:35,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2024-11-19 00:04:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:35,185 INFO L225 Difference]: With dead ends: 3291 [2024-11-19 00:04:35,185 INFO L226 Difference]: Without dead ends: 2195 [2024-11-19 00:04:35,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:35,192 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 483 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:35,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1323 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2024-11-19 00:04:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2193. [2024-11-19 00:04:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1808 states have (on average 1.5265486725663717) internal successors, (2760), 1812 states have internal predecessors, (2760), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 372 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-19 00:04:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3512 transitions. [2024-11-19 00:04:35,423 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3512 transitions. Word has length 596 [2024-11-19 00:04:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:35,424 INFO L471 AbstractCegarLoop]: Abstraction has 2193 states and 3512 transitions. [2024-11-19 00:04:35,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3512 transitions. [2024-11-19 00:04:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-19 00:04:35,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:35,439 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:35,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:04:35,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:35,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -733209520, now seen corresponding path program 1 times [2024-11-19 00:04:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199335172] [2024-11-19 00:04:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199335172] [2024-11-19 00:04:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199335172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:36,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:36,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20849192] [2024-11-19 00:04:36,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:36,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:36,454 INFO L87 Difference]: Start difference. First operand 2193 states and 3512 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:36,594 INFO L93 Difference]: Finished difference Result 6573 states and 10530 transitions. [2024-11-19 00:04:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2024-11-19 00:04:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:36,624 INFO L225 Difference]: With dead ends: 6573 [2024-11-19 00:04:36,624 INFO L226 Difference]: Without dead ends: 4383 [2024-11-19 00:04:36,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:36,635 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 291 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:36,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1086 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:04:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2024-11-19 00:04:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4381. [2024-11-19 00:04:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 3612 states have (on average 1.5227021040974529) internal successors, (5500), 3620 states have internal predecessors, (5500), 752 states have call successors, (752), 16 states have call predecessors, (752), 16 states have return successors, (752), 744 states have call predecessors, (752), 752 states have call successors, (752) [2024-11-19 00:04:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 7004 transitions. [2024-11-19 00:04:37,052 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 7004 transitions. Word has length 596 [2024-11-19 00:04:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:37,053 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 7004 transitions. [2024-11-19 00:04:37,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 7004 transitions. [2024-11-19 00:04:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:04:37,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:37,061 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:37,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:04:37,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:37,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash -62260316, now seen corresponding path program 1 times [2024-11-19 00:04:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694329384] [2024-11-19 00:04:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:37,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694329384] [2024-11-19 00:04:38,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694329384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:38,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:38,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:38,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839068460] [2024-11-19 00:04:38,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:38,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:38,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:38,081 INFO L87 Difference]: Start difference. First operand 4381 states and 7004 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:38,687 INFO L93 Difference]: Finished difference Result 9613 states and 15348 transitions. [2024-11-19 00:04:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2024-11-19 00:04:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:38,724 INFO L225 Difference]: With dead ends: 9613 [2024-11-19 00:04:38,725 INFO L226 Difference]: Without dead ends: 5235 [2024-11-19 00:04:38,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:04:38,742 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 382 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:38,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1451 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:04:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2024-11-19 00:04:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4849. [2024-11-19 00:04:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4849 states, 3987 states have (on average 1.5204414346626536) internal successors, (6062), 3995 states have internal predecessors, (6062), 843 states have call successors, (843), 18 states have call predecessors, (843), 18 states have return successors, (843), 835 states have call predecessors, (843), 843 states have call successors, (843) [2024-11-19 00:04:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 7748 transitions. [2024-11-19 00:04:39,228 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 7748 transitions. Word has length 597 [2024-11-19 00:04:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:39,229 INFO L471 AbstractCegarLoop]: Abstraction has 4849 states and 7748 transitions. [2024-11-19 00:04:39,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 7748 transitions. [2024-11-19 00:04:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:04:39,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:39,235 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:04:39,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash -926632267, now seen corresponding path program 1 times [2024-11-19 00:04:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306386664] [2024-11-19 00:04:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306386664] [2024-11-19 00:04:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306386664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:04:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758554906] [2024-11-19 00:04:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:04:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:04:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:04:42,302 INFO L87 Difference]: Start difference. First operand 4849 states and 7748 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:43,050 INFO L93 Difference]: Finished difference Result 14952 states and 23682 transitions. [2024-11-19 00:04:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:04:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2024-11-19 00:04:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:43,129 INFO L225 Difference]: With dead ends: 14952 [2024-11-19 00:04:43,130 INFO L226 Difference]: Without dead ends: 10494 [2024-11-19 00:04:43,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:04:43,149 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 880 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:43,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1385 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:04:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2024-11-19 00:04:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 7200. [2024-11-19 00:04:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 6338 states have (on average 1.5490691069738087) internal successors, (9818), 6346 states have internal predecessors, (9818), 843 states have call successors, (843), 18 states have call predecessors, (843), 18 states have return successors, (843), 835 states have call predecessors, (843), 843 states have call successors, (843) [2024-11-19 00:04:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 11504 transitions. [2024-11-19 00:04:43,855 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 11504 transitions. Word has length 597 [2024-11-19 00:04:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:43,856 INFO L471 AbstractCegarLoop]: Abstraction has 7200 states and 11504 transitions. [2024-11-19 00:04:43,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 11504 transitions. [2024-11-19 00:04:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:04:43,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:43,870 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:04:43,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1119633353, now seen corresponding path program 1 times [2024-11-19 00:04:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343925189] [2024-11-19 00:04:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343925189] [2024-11-19 00:04:46,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343925189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:46,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:04:46,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084293907] [2024-11-19 00:04:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:46,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:04:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:04:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:04:46,209 INFO L87 Difference]: Start difference. First operand 7200 states and 11504 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:46,932 INFO L93 Difference]: Finished difference Result 20792 states and 33119 transitions. [2024-11-19 00:04:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:04:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2024-11-19 00:04:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:46,990 INFO L225 Difference]: With dead ends: 20792 [2024-11-19 00:04:46,990 INFO L226 Difference]: Without dead ends: 14118 [2024-11-19 00:04:47,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:04:47,015 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 632 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:47,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1805 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:04:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14118 states. [2024-11-19 00:04:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14118 to 12804. [2024-11-19 00:04:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12804 states, 11798 states have (on average 1.5652652992032547) internal successors, (18467), 11822 states have internal predecessors, (18467), 971 states have call successors, (971), 34 states have call predecessors, (971), 34 states have return successors, (971), 947 states have call predecessors, (971), 971 states have call successors, (971) [2024-11-19 00:04:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 20409 transitions. [2024-11-19 00:04:47,769 INFO L78 Accepts]: Start accepts. Automaton has 12804 states and 20409 transitions. Word has length 597 [2024-11-19 00:04:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:47,770 INFO L471 AbstractCegarLoop]: Abstraction has 12804 states and 20409 transitions. [2024-11-19 00:04:47,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12804 states and 20409 transitions. [2024-11-19 00:04:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:04:47,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:47,778 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:04:47,779 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 424544699, now seen corresponding path program 1 times [2024-11-19 00:04:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575082967] [2024-11-19 00:04:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:04:48,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:48,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575082967] [2024-11-19 00:04:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575082967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309257325] [2024-11-19 00:04:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:48,149 INFO L87 Difference]: Start difference. First operand 12804 states and 20409 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:48,539 INFO L93 Difference]: Finished difference Result 23180 states and 36982 transitions. [2024-11-19 00:04:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2024-11-19 00:04:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:48,589 INFO L225 Difference]: With dead ends: 23180 [2024-11-19 00:04:48,589 INFO L226 Difference]: Without dead ends: 11154 [2024-11-19 00:04:48,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:48,622 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 482 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:48,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1288 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11154 states. [2024-11-19 00:04:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11154 to 11152. [2024-11-19 00:04:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11152 states, 10146 states have (on average 1.5321308890203036) internal successors, (15545), 10170 states have internal predecessors, (15545), 971 states have call successors, (971), 34 states have call predecessors, (971), 34 states have return successors, (971), 947 states have call predecessors, (971), 971 states have call successors, (971) [2024-11-19 00:04:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11152 states to 11152 states and 17487 transitions. [2024-11-19 00:04:49,406 INFO L78 Accepts]: Start accepts. Automaton has 11152 states and 17487 transitions. Word has length 597 [2024-11-19 00:04:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:49,407 INFO L471 AbstractCegarLoop]: Abstraction has 11152 states and 17487 transitions. [2024-11-19 00:04:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:04:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11152 states and 17487 transitions. [2024-11-19 00:04:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:04:49,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:49,420 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:04:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:04:49,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 136122553, now seen corresponding path program 1 times [2024-11-19 00:04:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162378642] [2024-11-19 00:04:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 75 proven. 195 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2024-11-19 00:04:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162378642] [2024-11-19 00:04:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162378642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:04:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737292268] [2024-11-19 00:04:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:04:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:53,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:04:53,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:04:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:53,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:04:53,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:04:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6210 proven. 66 refuted. 0 times theorem prover too weak. 10104 trivial. 0 not checked. [2024-11-19 00:04:54,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:04:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2024-11-19 00:04:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737292268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:04:54,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:04:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 00:04:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532133804] [2024-11-19 00:04:54,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:04:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:04:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:04:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:04:54,819 INFO L87 Difference]: Start difference. First operand 11152 states and 17487 transitions. Second operand has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 5 states have call successors, (204), 2 states have call predecessors, (204), 4 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2024-11-19 00:04:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:59,180 INFO L93 Difference]: Finished difference Result 42902 states and 67335 transitions. [2024-11-19 00:04:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 00:04:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 5 states have call successors, (204), 2 states have call predecessors, (204), 4 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) Word has length 597 [2024-11-19 00:04:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:59,278 INFO L225 Difference]: With dead ends: 42902 [2024-11-19 00:04:59,278 INFO L226 Difference]: Without dead ends: 32162 [2024-11-19 00:04:59,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1191 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=392, Invalid=1168, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:04:59,317 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 2782 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 1633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1633 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:59,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 3083 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1633 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 00:04:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32162 states. [2024-11-19 00:05:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32162 to 31902. [2024-11-19 00:05:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31902 states, 29034 states have (on average 1.5183577874216436) internal successors, (44084), 29106 states have internal predecessors, (44084), 2731 states have call successors, (2731), 136 states have call predecessors, (2731), 136 states have return successors, (2731), 2659 states have call predecessors, (2731), 2731 states have call successors, (2731) [2024-11-19 00:05:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31902 states to 31902 states and 49546 transitions. [2024-11-19 00:05:01,408 INFO L78 Accepts]: Start accepts. Automaton has 31902 states and 49546 transitions. Word has length 597 [2024-11-19 00:05:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 31902 states and 49546 transitions. [2024-11-19 00:05:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 5 states have call successors, (204), 2 states have call predecessors, (204), 4 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2024-11-19 00:05:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31902 states and 49546 transitions. [2024-11-19 00:05:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:05:01,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:01,419 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:01,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:05:01,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 00:05:01,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1730572885, now seen corresponding path program 1 times [2024-11-19 00:05:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278947295] [2024-11-19 00:05:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2024-11-19 00:05:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278947295] [2024-11-19 00:05:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278947295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004623423] [2024-11-19 00:05:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:01,910 INFO L87 Difference]: Start difference. First operand 31902 states and 49546 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:05:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:03,923 INFO L93 Difference]: Finished difference Result 94472 states and 146721 transitions. [2024-11-19 00:05:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2024-11-19 00:05:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:04,130 INFO L225 Difference]: With dead ends: 94472 [2024-11-19 00:05:04,130 INFO L226 Difference]: Without dead ends: 63490 [2024-11-19 00:05:04,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:04,215 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 476 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:04,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 967 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63490 states. [2024-11-19 00:05:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63490 to 63488. [2024-11-19 00:05:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63488 states, 57848 states have (on average 1.5066207993361913) internal successors, (87155), 57992 states have internal predecessors, (87155), 5371 states have call successors, (5371), 268 states have call predecessors, (5371), 268 states have return successors, (5371), 5227 states have call predecessors, (5371), 5371 states have call successors, (5371) [2024-11-19 00:05:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63488 states to 63488 states and 97897 transitions. [2024-11-19 00:05:08,054 INFO L78 Accepts]: Start accepts. Automaton has 63488 states and 97897 transitions. Word has length 597 [2024-11-19 00:05:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:08,055 INFO L471 AbstractCegarLoop]: Abstraction has 63488 states and 97897 transitions. [2024-11-19 00:05:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2024-11-19 00:05:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63488 states and 97897 transitions. [2024-11-19 00:05:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-19 00:05:08,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:08,069 INFO L215 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:08,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:05:08,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:08,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2124939671, now seen corresponding path program 1 times [2024-11-19 00:05:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:08,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826197767] [2024-11-19 00:05:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2024-11-19 00:05:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826197767] [2024-11-19 00:05:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826197767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:05:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030007120] [2024-11-19 00:05:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:10,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:05:10,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:10,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:05:10,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:05:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:11,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:05:11,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:05:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6388 proven. 69 refuted. 0 times theorem prover too weak. 9923 trivial. 0 not checked. [2024-11-19 00:05:12,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:05:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 201 proven. 69 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2024-11-19 00:05:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030007120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:05:13,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:05:13,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2024-11-19 00:05:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402290656] [2024-11-19 00:05:13,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:05:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:05:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:05:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:05:13,068 INFO L87 Difference]: Start difference. First operand 63488 states and 97897 transitions. Second operand has 17 states, 17 states have (on average 17.58823529411765) internal successors, (299), 17 states have internal predecessors, (299), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2024-11-19 00:05:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:22,247 INFO L93 Difference]: Finished difference Result 240420 states and 367628 transitions. [2024-11-19 00:05:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-19 00:05:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.58823529411765) internal successors, (299), 17 states have internal predecessors, (299), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) Word has length 597 [2024-11-19 00:05:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted.