./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.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-44.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 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:04:08,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:04:08,589 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:08,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:04:08,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:04:08,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:04:08,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:04:08,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:04:08,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:04:08,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:04:08,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:04:08,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:04:08,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:04:08,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:04:08,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:04:08,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:04:08,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:04:08,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:04:08,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:04:08,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:04:08,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:04:08,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:04:08,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:04:08,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:04:08,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:04:08,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:04:08,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:04:08,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:04:08,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:04:08,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:04:08,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:04:08,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:04:08,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:04:08,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:04:08,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:04:08,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:04:08,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:04:08,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:04:08,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:04:08,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:04:08,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:04:08,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:04:08,646 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 -> 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 [2024-11-19 00:04:08,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:04:08,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:04:08,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:04:08,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:04:08,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:04:08,956 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-44.i [2024-11-19 00:04:10,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:04:10,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:04:10,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.i [2024-11-19 00:04:10,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0576f7efd/994b37317cee40f996d7fecd8805180e/FLAG9a3add64c [2024-11-19 00:04:10,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0576f7efd/994b37317cee40f996d7fecd8805180e [2024-11-19 00:04:10,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:04:10,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:04:10,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:04:10,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:04:10,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:04:10,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:10" (1/1) ... [2024-11-19 00:04:10,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd7df42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:10, skipping insertion in model container [2024-11-19 00:04:10,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:10" (1/1) ... [2024-11-19 00:04:10,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:04:10,997 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-44.i[916,929] [2024-11-19 00:04:11,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:04:11,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:04:11,320 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-44.i[916,929] [2024-11-19 00:04:11,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:04:11,459 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:04:11,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:11 WrapperNode [2024-11-19 00:04:11,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:04:11,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:04:11,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:04:11,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:04:11,468 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:11" (1/1) ... [2024-11-19 00:04:11,496 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:11" (1/1) ... [2024-11-19 00:04:11,585 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 772 [2024-11-19 00:04:11,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:04:11,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:04:11,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:04:11,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:04:11,599 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:11" (1/1) ... [2024-11-19 00:04:11,599 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:11" (1/1) ... [2024-11-19 00:04:11,614 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:11" (1/1) ... [2024-11-19 00:04:11,673 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:11,673 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:11" (1/1) ... [2024-11-19 00:04:11,673 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:11" (1/1) ... [2024-11-19 00:04:11,745 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:11" (1/1) ... [2024-11-19 00:04:11,752 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:11" (1/1) ... [2024-11-19 00:04:11,760 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:11" (1/1) ... [2024-11-19 00:04:11,798 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:11" (1/1) ... [2024-11-19 00:04:11,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:04:11,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:04:11,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:04:11,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:04:11,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:11" (1/1) ... [2024-11-19 00:04:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:04:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:11,856 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:11,862 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:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:04:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:04:11,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:04:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:04:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:04:11,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:04:12,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:04:12,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:04:13,389 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-11-19 00:04:13,389 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:04:13,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:04:13,416 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:04:13,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:13 BoogieIcfgContainer [2024-11-19 00:04:13,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:04:13,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:04:13,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:04:13,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:04:13,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:04:10" (1/3) ... [2024-11-19 00:04:13,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2475e3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:13, skipping insertion in model container [2024-11-19 00:04:13,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:11" (2/3) ... [2024-11-19 00:04:13,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2475e3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:13, skipping insertion in model container [2024-11-19 00:04:13,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:13" (3/3) ... [2024-11-19 00:04:13,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-44.i [2024-11-19 00:04:13,445 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:04:13,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:04:13,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:04:13,543 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;@2fb9bb66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:04:13,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:04:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 235 states have (on average 1.574468085106383) internal successors, (370), 236 states have internal predecessors, (370), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 00:04:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:13,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:13,583 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:13,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 635257499, now seen corresponding path program 1 times [2024-11-19 00:04:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683324743] [2024-11-19 00:04:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2024-11-19 00:04:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683324743] [2024-11-19 00:04:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683324743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:04:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568471854] [2024-11-19 00:04:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:14,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:04:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:14,346 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:14,347 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:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:14,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:04:14,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:04:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2024-11-19 00:04:14,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:04:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568471854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:14,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:04:14,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:04:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618197] [2024-11-19 00:04:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:14,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:04:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:14,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:04:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:04:14,877 INFO L87 Difference]: Start difference. First operand has 289 states, 235 states have (on average 1.574468085106383) internal successors, (370), 236 states have internal predecessors, (370), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:04:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:14,956 INFO L93 Difference]: Finished difference Result 563 states and 976 transitions. [2024-11-19 00:04:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:04:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 373 [2024-11-19 00:04:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:14,977 INFO L225 Difference]: With dead ends: 563 [2024-11-19 00:04:14,979 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 00:04:14,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 374 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:14,992 INFO L432 NwaCegarLoop]: 450 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, 450 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:14,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 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:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 00:04:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-19 00:04:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 224 states have internal predecessors, (348), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 00:04:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 450 transitions. [2024-11-19 00:04:15,092 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 450 transitions. Word has length 373 [2024-11-19 00:04:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 450 transitions. [2024-11-19 00:04:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:04:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 450 transitions. [2024-11-19 00:04:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:15,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:15,109 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:04:15,313 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:15,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -229126947, now seen corresponding path program 1 times [2024-11-19 00:04:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:15,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943443827] [2024-11-19 00:04:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943443827] [2024-11-19 00:04:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943443827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074879423] [2024-11-19 00:04:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:15,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:15,795 INFO L87 Difference]: Start difference. First operand 277 states and 450 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:16,003 INFO L93 Difference]: Finished difference Result 756 states and 1228 transitions. [2024-11-19 00:04:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:16,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2024-11-19 00:04:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:16,010 INFO L225 Difference]: With dead ends: 756 [2024-11-19 00:04:16,010 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 00:04:16,012 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:16,013 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 328 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:16,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 896 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:04:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 00:04:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 479. [2024-11-19 00:04:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 414 states have (on average 1.5748792270531402) internal successors, (652), 415 states have internal predecessors, (652), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:04:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 776 transitions. [2024-11-19 00:04:16,059 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 776 transitions. Word has length 373 [2024-11-19 00:04:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:16,060 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 776 transitions. [2024-11-19 00:04:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 776 transitions. [2024-11-19 00:04:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:16,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:16,068 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:04:16,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:16,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1888592091, now seen corresponding path program 1 times [2024-11-19 00:04:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:16,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924580189] [2024-11-19 00:04:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924580189] [2024-11-19 00:04:16,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924580189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:16,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:16,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730522525] [2024-11-19 00:04:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:16,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:16,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:16,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:16,461 INFO L87 Difference]: Start difference. First operand 479 states and 776 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:16,585 INFO L93 Difference]: Finished difference Result 1429 states and 2318 transitions. [2024-11-19 00:04:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2024-11-19 00:04:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:16,598 INFO L225 Difference]: With dead ends: 1429 [2024-11-19 00:04:16,600 INFO L226 Difference]: Without dead ends: 953 [2024-11-19 00:04:16,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:16,604 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 440 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:16,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1073 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-19 00:04:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 517. [2024-11-19 00:04:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 452 states have (on average 1.5685840707964602) internal successors, (709), 453 states have internal predecessors, (709), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:04:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 833 transitions. [2024-11-19 00:04:16,656 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 833 transitions. Word has length 373 [2024-11-19 00:04:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 833 transitions. [2024-11-19 00:04:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 833 transitions. [2024-11-19 00:04:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:16,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:16,664 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:04:16,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1066965983, now seen corresponding path program 1 times [2024-11-19 00:04:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974406785] [2024-11-19 00:04:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974406785] [2024-11-19 00:04:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974406785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551199622] [2024-11-19 00:04:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:17,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:17,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:17,002 INFO L87 Difference]: Start difference. First operand 517 states and 833 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:17,101 INFO L93 Difference]: Finished difference Result 1505 states and 2427 transitions. [2024-11-19 00:04:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:17,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2024-11-19 00:04:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:17,110 INFO L225 Difference]: With dead ends: 1505 [2024-11-19 00:04:17,110 INFO L226 Difference]: Without dead ends: 991 [2024-11-19 00:04:17,112 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:17,113 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 417 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:17,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 886 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-19 00:04:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 525. [2024-11-19 00:04:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 460 states have (on average 1.567391304347826) internal successors, (721), 461 states have internal predecessors, (721), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:04:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 845 transitions. [2024-11-19 00:04:17,147 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 845 transitions. Word has length 373 [2024-11-19 00:04:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:17,148 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 845 transitions. [2024-11-19 00:04:17,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 845 transitions. [2024-11-19 00:04:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:17,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:17,154 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:04:17,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:17,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash -818819489, now seen corresponding path program 1 times [2024-11-19 00:04:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85190781] [2024-11-19 00:04:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85190781] [2024-11-19 00:04:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85190781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946831842] [2024-11-19 00:04:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:17,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:17,502 INFO L87 Difference]: Start difference. First operand 525 states and 845 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:17,656 INFO L93 Difference]: Finished difference Result 1557 states and 2505 transitions. [2024-11-19 00:04:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2024-11-19 00:04:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:17,665 INFO L225 Difference]: With dead ends: 1557 [2024-11-19 00:04:17,666 INFO L226 Difference]: Without dead ends: 1035 [2024-11-19 00:04:17,667 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:17,669 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 422 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:17,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1159 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-19 00:04:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 623. [2024-11-19 00:04:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 558 states have (on average 1.5949820788530467) internal successors, (890), 559 states have internal predecessors, (890), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:04:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1014 transitions. [2024-11-19 00:04:17,710 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1014 transitions. Word has length 373 [2024-11-19 00:04:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:17,713 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1014 transitions. [2024-11-19 00:04:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1014 transitions. [2024-11-19 00:04:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-19 00:04:17,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:17,720 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:04:17,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1213186275, now seen corresponding path program 1 times [2024-11-19 00:04:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140719550] [2024-11-19 00:04:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140719550] [2024-11-19 00:04:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140719550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:18,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982697953] [2024-11-19 00:04:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:18,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:18,007 INFO L87 Difference]: Start difference. First operand 623 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:18,121 INFO L93 Difference]: Finished difference Result 1655 states and 2668 transitions. [2024-11-19 00:04:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2024-11-19 00:04:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:18,128 INFO L225 Difference]: With dead ends: 1655 [2024-11-19 00:04:18,128 INFO L226 Difference]: Without dead ends: 1035 [2024-11-19 00:04:18,130 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:18,131 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 426 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:18,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1005 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-19 00:04:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 623. [2024-11-19 00:04:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 558 states have (on average 1.5842293906810037) internal successors, (884), 559 states have internal predecessors, (884), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:04:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1008 transitions. [2024-11-19 00:04:18,189 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1008 transitions. Word has length 373 [2024-11-19 00:04:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:18,190 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1008 transitions. [2024-11-19 00:04:18,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1008 transitions. [2024-11-19 00:04:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-19 00:04:18,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:18,198 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:04:18,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:18,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:18,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2137981204, now seen corresponding path program 1 times [2024-11-19 00:04:18,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988357888] [2024-11-19 00:04:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:19,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988357888] [2024-11-19 00:04:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988357888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585230751] [2024-11-19 00:04:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:19,019 INFO L87 Difference]: Start difference. First operand 623 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:19,103 INFO L93 Difference]: Finished difference Result 1863 states and 3018 transitions. [2024-11-19 00:04:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2024-11-19 00:04:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:19,110 INFO L225 Difference]: With dead ends: 1863 [2024-11-19 00:04:19,110 INFO L226 Difference]: Without dead ends: 1243 [2024-11-19 00:04:19,112 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:19,113 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 383 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:19,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 881 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:04:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-19 00:04:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1241. [2024-11-19 00:04:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1112 states have (on average 1.5827338129496402) internal successors, (1760), 1114 states have internal predecessors, (1760), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-19 00:04:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2008 transitions. [2024-11-19 00:04:19,169 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2008 transitions. Word has length 374 [2024-11-19 00:04:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:19,170 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 2008 transitions. [2024-11-19 00:04:19,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2008 transitions. [2024-11-19 00:04:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-19 00:04:19,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:19,177 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:04:19,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash 568638190, now seen corresponding path program 1 times [2024-11-19 00:04:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648858147] [2024-11-19 00:04:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648858147] [2024-11-19 00:04:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648858147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:04:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42862154] [2024-11-19 00:04:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:20,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:04:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:04:20,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:04:20,398 INFO L87 Difference]: Start difference. First operand 1241 states and 2008 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:21,010 INFO L93 Difference]: Finished difference Result 3570 states and 5787 transitions. [2024-11-19 00:04:21,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:04:21,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2024-11-19 00:04:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:21,026 INFO L225 Difference]: With dead ends: 3570 [2024-11-19 00:04:21,026 INFO L226 Difference]: Without dead ends: 2332 [2024-11-19 00:04:21,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:04:21,031 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 389 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:21,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 2054 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:04:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2024-11-19 00:04:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1398. [2024-11-19 00:04:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1217 states have (on average 1.5735414954806901) internal successors, (1915), 1219 states have internal predecessors, (1915), 175 states have call successors, (175), 5 states have call predecessors, (175), 5 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-19 00:04:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2265 transitions. [2024-11-19 00:04:21,139 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2265 transitions. Word has length 374 [2024-11-19 00:04:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:21,140 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2265 transitions. [2024-11-19 00:04:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2265 transitions. [2024-11-19 00:04:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-19 00:04:21,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:21,148 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:04:21,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:21,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 645538988, now seen corresponding path program 1 times [2024-11-19 00:04:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615303732] [2024-11-19 00:04:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615303732] [2024-11-19 00:04:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615303732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247299944] [2024-11-19 00:04:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:22,205 INFO L87 Difference]: Start difference. First operand 1398 states and 2265 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:22,775 INFO L93 Difference]: Finished difference Result 4415 states and 7156 transitions. [2024-11-19 00:04:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2024-11-19 00:04:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:22,792 INFO L225 Difference]: With dead ends: 4415 [2024-11-19 00:04:22,793 INFO L226 Difference]: Without dead ends: 3110 [2024-11-19 00:04:22,797 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:22,800 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 710 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:22,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1483 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:04:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-11-19 00:04:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2126. [2024-11-19 00:04:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1839 states have (on average 1.5671560630777597) internal successors, (2882), 1841 states have internal predecessors, (2882), 277 states have call successors, (277), 9 states have call predecessors, (277), 9 states have return successors, (277), 275 states have call predecessors, (277), 277 states have call successors, (277) [2024-11-19 00:04:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3436 transitions. [2024-11-19 00:04:22,959 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3436 transitions. Word has length 374 [2024-11-19 00:04:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 3436 transitions. [2024-11-19 00:04:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3436 transitions. [2024-11-19 00:04:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-19 00:04:22,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:22,967 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:04:22,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:22,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1596422542, now seen corresponding path program 1 times [2024-11-19 00:04:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346133149] [2024-11-19 00:04:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346133149] [2024-11-19 00:04:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346133149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:24,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751699175] [2024-11-19 00:04:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:24,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:24,290 INFO L87 Difference]: Start difference. First operand 2126 states and 3436 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:24,789 INFO L93 Difference]: Finished difference Result 5968 states and 9654 transitions. [2024-11-19 00:04:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 375 [2024-11-19 00:04:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:24,811 INFO L225 Difference]: With dead ends: 5968 [2024-11-19 00:04:24,812 INFO L226 Difference]: Without dead ends: 3940 [2024-11-19 00:04:24,817 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:24,818 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 442 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:24,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1406 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:04:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2024-11-19 00:04:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 2498. [2024-11-19 00:04:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2211 states have (on average 1.5685210312075983) internal successors, (3468), 2213 states have internal predecessors, (3468), 277 states have call successors, (277), 9 states have call predecessors, (277), 9 states have return successors, (277), 275 states have call predecessors, (277), 277 states have call successors, (277) [2024-11-19 00:04:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4022 transitions. [2024-11-19 00:04:25,073 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4022 transitions. Word has length 375 [2024-11-19 00:04:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:25,074 INFO L471 AbstractCegarLoop]: Abstraction has 2498 states and 4022 transitions. [2024-11-19 00:04:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4022 transitions. [2024-11-19 00:04:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-19 00:04:25,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:25,084 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:04:25,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -560662834, now seen corresponding path program 1 times [2024-11-19 00:04:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141503083] [2024-11-19 00:04:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141503083] [2024-11-19 00:04:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141503083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:26,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369106003] [2024-11-19 00:04:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:26,288 INFO L87 Difference]: Start difference. First operand 2498 states and 4022 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:26,541 INFO L93 Difference]: Finished difference Result 6182 states and 9938 transitions. [2024-11-19 00:04:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2024-11-19 00:04:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:26,565 INFO L225 Difference]: With dead ends: 6182 [2024-11-19 00:04:26,565 INFO L226 Difference]: Without dead ends: 4238 [2024-11-19 00:04:26,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:26,573 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 623 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1140 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2024-11-19 00:04:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 3876. [2024-11-19 00:04:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3431 states have (on average 1.5616438356164384) internal successors, (5358), 3439 states have internal predecessors, (5358), 423 states have call successors, (423), 21 states have call predecessors, (423), 21 states have return successors, (423), 415 states have call predecessors, (423), 423 states have call successors, (423) [2024-11-19 00:04:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 6204 transitions. [2024-11-19 00:04:26,849 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 6204 transitions. Word has length 376 [2024-11-19 00:04:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 6204 transitions. [2024-11-19 00:04:26,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 6204 transitions. [2024-11-19 00:04:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-19 00:04:26,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:26,862 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:04:26,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2009393714, now seen corresponding path program 1 times [2024-11-19 00:04:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564128770] [2024-11-19 00:04:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564128770] [2024-11-19 00:04:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564128770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:28,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884059156] [2024-11-19 00:04:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:28,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:28,230 INFO L87 Difference]: Start difference. First operand 3876 states and 6204 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:28,820 INFO L93 Difference]: Finished difference Result 11730 states and 18618 transitions. [2024-11-19 00:04:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2024-11-19 00:04:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:28,875 INFO L225 Difference]: With dead ends: 11730 [2024-11-19 00:04:28,875 INFO L226 Difference]: Without dead ends: 8084 [2024-11-19 00:04:28,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:04:28,885 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 590 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:28,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1277 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:04:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8084 states. [2024-11-19 00:04:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8084 to 6658. [2024-11-19 00:04:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6658 states, 6146 states have (on average 1.5611780019524895) internal successors, (9595), 6166 states have internal predecessors, (9595), 471 states have call successors, (471), 40 states have call predecessors, (471), 40 states have return successors, (471), 451 states have call predecessors, (471), 471 states have call successors, (471) [2024-11-19 00:04:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 10537 transitions. [2024-11-19 00:04:29,324 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 10537 transitions. Word has length 376 [2024-11-19 00:04:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:29,325 INFO L471 AbstractCegarLoop]: Abstraction has 6658 states and 10537 transitions. [2024-11-19 00:04:29,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 10537 transitions. [2024-11-19 00:04:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-19 00:04:29,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:29,342 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:04:29,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1544640149, now seen corresponding path program 1 times [2024-11-19 00:04:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650539539] [2024-11-19 00:04:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650539539] [2024-11-19 00:04:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650539539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:04:29,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874838021] [2024-11-19 00:04:29,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:04:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:04:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:04:29,565 INFO L87 Difference]: Start difference. First operand 6658 states and 10537 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:29,880 INFO L93 Difference]: Finished difference Result 15352 states and 24319 transitions. [2024-11-19 00:04:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:04:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2024-11-19 00:04:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:29,912 INFO L225 Difference]: With dead ends: 15352 [2024-11-19 00:04:29,912 INFO L226 Difference]: Without dead ends: 9528 [2024-11-19 00:04:29,928 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:29,929 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 148 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:29,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 929 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:04:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9528 states. [2024-11-19 00:04:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9528 to 7294. [2024-11-19 00:04:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7294 states, 6782 states have (on average 1.5716602772043644) internal successors, (10659), 6802 states have internal predecessors, (10659), 471 states have call successors, (471), 40 states have call predecessors, (471), 40 states have return successors, (471), 451 states have call predecessors, (471), 471 states have call successors, (471) [2024-11-19 00:04:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7294 states to 7294 states and 11601 transitions. [2024-11-19 00:04:30,326 INFO L78 Accepts]: Start accepts. Automaton has 7294 states and 11601 transitions. Word has length 376 [2024-11-19 00:04:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:30,327 INFO L471 AbstractCegarLoop]: Abstraction has 7294 states and 11601 transitions. [2024-11-19 00:04:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7294 states and 11601 transitions. [2024-11-19 00:04:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-19 00:04:30,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:30,343 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:04:30,343 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 756182441, now seen corresponding path program 1 times [2024-11-19 00:04:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:30,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690874690] [2024-11-19 00:04:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690874690] [2024-11-19 00:04:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690874690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:04:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343027840] [2024-11-19 00:04:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:32,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:04:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:32,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:04:32,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:04:32,830 INFO L87 Difference]: Start difference. First operand 7294 states and 11601 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:04:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:34,004 INFO L93 Difference]: Finished difference Result 19718 states and 31505 transitions. [2024-11-19 00:04:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:04:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 376 [2024-11-19 00:04:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:34,045 INFO L225 Difference]: With dead ends: 19718 [2024-11-19 00:04:34,046 INFO L226 Difference]: Without dead ends: 12900 [2024-11-19 00:04:34,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:04:34,068 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 709 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:34,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1957 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:04:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12900 states. [2024-11-19 00:04:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12900 to 7294. [2024-11-19 00:04:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7294 states, 6782 states have (on average 1.571070480684164) internal successors, (10655), 6802 states have internal predecessors, (10655), 471 states have call successors, (471), 40 states have call predecessors, (471), 40 states have return successors, (471), 451 states have call predecessors, (471), 471 states have call successors, (471) [2024-11-19 00:04:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7294 states to 7294 states and 11597 transitions. [2024-11-19 00:04:34,493 INFO L78 Accepts]: Start accepts. Automaton has 7294 states and 11597 transitions. Word has length 376 [2024-11-19 00:04:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:34,494 INFO L471 AbstractCegarLoop]: Abstraction has 7294 states and 11597 transitions. [2024-11-19 00:04:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:04:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7294 states and 11597 transitions. [2024-11-19 00:04:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-19 00:04:34,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:34,511 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:04:34,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 696118565, now seen corresponding path program 1 times [2024-11-19 00:04:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184680615] [2024-11-19 00:04:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184680615] [2024-11-19 00:04:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184680615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:04:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754650805] [2024-11-19 00:04:35,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:35,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:04:35,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:04:35,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:35,651 INFO L87 Difference]: Start difference. First operand 7294 states and 11597 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:36,174 INFO L93 Difference]: Finished difference Result 17729 states and 28233 transitions. [2024-11-19 00:04:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:04:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2024-11-19 00:04:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:36,209 INFO L225 Difference]: With dead ends: 17729 [2024-11-19 00:04:36,209 INFO L226 Difference]: Without dead ends: 11269 [2024-11-19 00:04:36,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:04:36,226 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 725 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:36,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1150 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:04:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2024-11-19 00:04:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 10199. [2024-11-19 00:04:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 9687 states have (on average 1.5945081036440591) internal successors, (15446), 9707 states have internal predecessors, (15446), 471 states have call successors, (471), 40 states have call predecessors, (471), 40 states have return successors, (471), 451 states have call predecessors, (471), 471 states have call successors, (471) [2024-11-19 00:04:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 16388 transitions. [2024-11-19 00:04:36,673 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 16388 transitions. Word has length 377 [2024-11-19 00:04:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 16388 transitions. [2024-11-19 00:04:36,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 16388 transitions. [2024-11-19 00:04:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-19 00:04:36,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:36,692 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:04:36,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -892229337, now seen corresponding path program 1 times [2024-11-19 00:04:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99748471] [2024-11-19 00:04:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99748471] [2024-11-19 00:04:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99748471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:04:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727389996] [2024-11-19 00:04:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:42,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:04:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:42,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:04:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:04:42,823 INFO L87 Difference]: Start difference. First operand 10199 states and 16388 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:46,233 INFO L93 Difference]: Finished difference Result 43847 states and 70638 transitions. [2024-11-19 00:04:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:04:46,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2024-11-19 00:04:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:46,325 INFO L225 Difference]: With dead ends: 43847 [2024-11-19 00:04:46,326 INFO L226 Difference]: Without dead ends: 34881 [2024-11-19 00:04:46,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:04:46,366 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 2627 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2627 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:46,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2627 Valid, 3875 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 00:04:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34881 states. [2024-11-19 00:04:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34881 to 18504. [2024-11-19 00:04:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18504 states, 17838 states have (on average 1.602982397129723) internal successors, (28594), 17866 states have internal predecessors, (28594), 611 states have call successors, (611), 54 states have call predecessors, (611), 54 states have return successors, (611), 583 states have call predecessors, (611), 611 states have call successors, (611) [2024-11-19 00:04:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18504 states to 18504 states and 29816 transitions. [2024-11-19 00:04:47,210 INFO L78 Accepts]: Start accepts. Automaton has 18504 states and 29816 transitions. Word has length 377 [2024-11-19 00:04:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:47,211 INFO L471 AbstractCegarLoop]: Abstraction has 18504 states and 29816 transitions. [2024-11-19 00:04:47,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2024-11-19 00:04:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 18504 states and 29816 transitions. [2024-11-19 00:04:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-19 00:04:47,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:47,247 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:04:47,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1871670124, now seen corresponding path program 1 times [2024-11-19 00:04:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327790811] [2024-11-19 00:04:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2024-11-19 00:04:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327790811] [2024-11-19 00:04:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327790811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:04:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830344656] [2024-11-19 00:04:48,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:04:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:48,560 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:48,562 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:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:49,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:04:49,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:04:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2000 proven. 111 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2024-11-19 00:04:49,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:04:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 39 proven. 111 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2024-11-19 00:04:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830344656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:04:49,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:04:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-11-19 00:04:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630576498] [2024-11-19 00:04:49,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:04:49,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:04:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:04:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:04:49,854 INFO L87 Difference]: Start difference. First operand 18504 states and 29816 transitions. Second operand has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 3 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 3 states have call predecessors, (140), 3 states have call successors, (140) [2024-11-19 00:04:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:51,223 INFO L93 Difference]: Finished difference Result 41361 states and 66816 transitions. [2024-11-19 00:04:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:04:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 3 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 3 states have call predecessors, (140), 3 states have call successors, (140) Word has length 377 [2024-11-19 00:04:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:51,308 INFO L225 Difference]: With dead ends: 41361 [2024-11-19 00:04:51,308 INFO L226 Difference]: Without dead ends: 27702 [2024-11-19 00:04:51,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:04:51,344 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1375 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:51,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1926 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:04:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27702 states. [2024-11-19 00:04:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27702 to 17140. [2024-11-19 00:04:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17140 states, 16432 states have (on average 1.5651168451801363) internal successors, (25718), 16460 states have internal predecessors, (25718), 611 states have call successors, (611), 96 states have call predecessors, (611), 96 states have return successors, (611), 583 states have call predecessors, (611), 611 states have call successors, (611) [2024-11-19 00:04:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 26940 transitions. [2024-11-19 00:04:51,975 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 26940 transitions. Word has length 377 [2024-11-19 00:04:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:51,976 INFO L471 AbstractCegarLoop]: Abstraction has 17140 states and 26940 transitions. [2024-11-19 00:04:51,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 3 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 3 states have call predecessors, (140), 3 states have call successors, (140) [2024-11-19 00:04:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 26940 transitions. [2024-11-19 00:04:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-19 00:04:52,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:52,008 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,030 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:04:52,211 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,SelfDestructingSolverStorable16 [2024-11-19 00:04:52,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1228206497, now seen corresponding path program 1 times [2024-11-19 00:04:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658089869] [2024-11-19 00:04:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 9 proven. 141 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2024-11-19 00:04:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658089869] [2024-11-19 00:04:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658089869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:04:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007353591] [2024-11-19 00:04:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:04:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:04:53,368 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:04:53,369 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:04:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:53,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:04:53,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:04:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2600 proven. 75 refuted. 0 times theorem prover too weak. 2425 trivial. 0 not checked. [2024-11-19 00:04:53,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:04:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2024-11-19 00:04:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007353591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:04:54,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:04:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-19 00:04:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686211964] [2024-11-19 00:04:54,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:04:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:04:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:04:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:04:54,284 INFO L87 Difference]: Start difference. First operand 17140 states and 26940 transitions. Second operand has 11 states, 11 states have (on average 26.09090909090909) internal successors, (287), 11 states have internal predecessors, (287), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) [2024-11-19 00:04:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:04:55,646 INFO L93 Difference]: Finished difference Result 33697 states and 52819 transitions. [2024-11-19 00:04:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:04:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 26.09090909090909) internal successors, (287), 11 states have internal predecessors, (287), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) Word has length 378 [2024-11-19 00:04:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:04:55,694 INFO L225 Difference]: With dead ends: 33697 [2024-11-19 00:04:55,694 INFO L226 Difference]: Without dead ends: 18244 [2024-11-19 00:04:55,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:04:55,725 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 937 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:04:55,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2493 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:04:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18244 states. [2024-11-19 00:04:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18244 to 13596. [2024-11-19 00:04:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13596 states, 13138 states have (on average 1.557923580453646) internal successors, (20468), 13150 states have internal predecessors, (20468), 395 states have call successors, (395), 62 states have call predecessors, (395), 62 states have return successors, (395), 383 states have call predecessors, (395), 395 states have call successors, (395) [2024-11-19 00:04:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 21258 transitions. [2024-11-19 00:04:56,305 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 21258 transitions. Word has length 378 [2024-11-19 00:04:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:04:56,305 INFO L471 AbstractCegarLoop]: Abstraction has 13596 states and 21258 transitions. [2024-11-19 00:04:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.09090909090909) internal successors, (287), 11 states have internal predecessors, (287), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) [2024-11-19 00:04:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 21258 transitions. [2024-11-19 00:04:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-19 00:04:56,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:04:56,334 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:04:56,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 00:04:56,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:04:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:04:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1279687822, now seen corresponding path program 1 times [2024-11-19 00:04:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:04:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205144484] [2024-11-19 00:04:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:04:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:04:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:04:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:04:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205144484] [2024-11-19 00:04:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205144484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:04:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:04:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:04:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601842510] [2024-11-19 00:04:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:04:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:04:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:04:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:04:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:04:58,981 INFO L87 Difference]: Start difference. First operand 13596 states and 21258 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:05:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:04,354 INFO L93 Difference]: Finished difference Result 65366 states and 99896 transitions. [2024-11-19 00:05:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:05:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 379 [2024-11-19 00:05:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:04,504 INFO L225 Difference]: With dead ends: 65366 [2024-11-19 00:05:04,504 INFO L226 Difference]: Without dead ends: 57569 [2024-11-19 00:05:04,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:05:04,533 INFO L432 NwaCegarLoop]: 1467 mSDtfsCounter, 3832 mSDsluCounter, 6722 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3832 SdHoareTripleChecker+Valid, 8189 SdHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 819 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:04,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3832 Valid, 8189 Invalid, 3505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [819 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 00:05:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57569 states. [2024-11-19 00:05:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57569 to 32446. [2024-11-19 00:05:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32446 states, 31458 states have (on average 1.5447898785682497) internal successors, (48596), 31494 states have internal predecessors, (48596), 833 states have call successors, (833), 154 states have call predecessors, (833), 154 states have return successors, (833), 797 states have call predecessors, (833), 833 states have call successors, (833) [2024-11-19 00:05:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32446 states to 32446 states and 50262 transitions. [2024-11-19 00:05:06,008 INFO L78 Accepts]: Start accepts. Automaton has 32446 states and 50262 transitions. Word has length 379 [2024-11-19 00:05:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 32446 states and 50262 transitions. [2024-11-19 00:05:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:05:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32446 states and 50262 transitions. [2024-11-19 00:05:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-19 00:05:06,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:06,043 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:05:06,043 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:06,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2137311854, now seen corresponding path program 1 times [2024-11-19 00:05:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230475372] [2024-11-19 00:05:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-19 00:05:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230475372] [2024-11-19 00:05:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230475372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:05:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293448774] [2024-11-19 00:05:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:05:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:05:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:05:07,168 INFO L87 Difference]: Start difference. First operand 32446 states and 50262 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-19 00:05:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:09,103 INFO L93 Difference]: Finished difference Result 101469 states and 156850 transitions. [2024-11-19 00:05:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:05:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 379 [2024-11-19 00:05:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:09,486 INFO L225 Difference]: With dead ends: 101469 [2024-11-19 00:05:09,486 INFO L226 Difference]: Without dead ends: 75324 [2024-11-19 00:05:09,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:05:09,531 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 1081 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:09,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 2793 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:05:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75324 states.