./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-30.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-30.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 9a12fb13f4579599874276f15d887898a52c4d97dbae858ff08fc2462341b39d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:02:49,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:02:49,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:02:49,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:02:49,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:02:49,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:02:49,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:02:49,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:02:49,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:02:49,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:02:49,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:02:49,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:02:49,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:02:50,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:02:50,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:02:50,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:02:50,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:02:50,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:02:50,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:02:50,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:02:50,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:02:50,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:02:50,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:02:50,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:02:50,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:02:50,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:02:50,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:02:50,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:02:50,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:02:50,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:02:50,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:02:50,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:02:50,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:50,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:02:50,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:02:50,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:02:50,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:02:50,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:02:50,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:02:50,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:02:50,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:02:50,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:02:50,012 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 -> 9a12fb13f4579599874276f15d887898a52c4d97dbae858ff08fc2462341b39d [2024-11-19 00:02:50,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:02:50,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:02:50,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:02:50,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:02:50,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:02:50,280 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-30.i [2024-11-19 00:02:51,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:02:51,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:02:51,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-30.i [2024-11-19 00:02:51,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee4ca778/6e3e3bdbf79548329d5660b000683bc0/FLAG28c75cc0a [2024-11-19 00:02:51,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee4ca778/6e3e3bdbf79548329d5660b000683bc0 [2024-11-19 00:02:51,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:02:51,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:02:51,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:51,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:02:51,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:02:51,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:51" (1/1) ... [2024-11-19 00:02:51,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3544ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:51, skipping insertion in model container [2024-11-19 00:02:51,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:51" (1/1) ... [2024-11-19 00:02:52,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:02:52,228 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-30.i[916,929] [2024-11-19 00:02:52,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:52,463 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:02:52,474 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-30.i[916,929] [2024-11-19 00:02:52,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:52,606 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:02:52,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52 WrapperNode [2024-11-19 00:02:52,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:52,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:52,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:02:52,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:02:52,615 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:02:52" (1/1) ... [2024-11-19 00:02:52,651 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:02:52" (1/1) ... [2024-11-19 00:02:52,735 INFO L138 Inliner]: procedures = 26, calls = 98, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 789 [2024-11-19 00:02:52,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:52,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:02:52,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:02:52,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:02:52,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,822 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:02:52,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:02:52,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:02:52,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:02:52,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:02:52,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (1/1) ... [2024-11-19 00:02:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:52,963 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:02:52,967 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:02:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:02:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:02:53,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:02:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:02:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:02:53,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:02:53,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:02:53,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:02:54,384 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-19 00:02:54,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:02:54,408 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:02:54,409 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:02:54,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:54 BoogieIcfgContainer [2024-11-19 00:02:54,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:02:54,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:02:54,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:02:54,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:02:54,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:02:51" (1/3) ... [2024-11-19 00:02:54,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d55e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:54, skipping insertion in model container [2024-11-19 00:02:54,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:52" (2/3) ... [2024-11-19 00:02:54,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d55e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:54, skipping insertion in model container [2024-11-19 00:02:54,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:54" (3/3) ... [2024-11-19 00:02:54,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-30.i [2024-11-19 00:02:54,433 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:02:54,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:02:54,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:02:54,510 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;@42bcfd11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:02:54,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:02:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 222 states have (on average 1.5) internal successors, (333), 223 states have internal predecessors, (333), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:02:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:02:54,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:54,554 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:54,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:54,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash 310837936, now seen corresponding path program 1 times [2024-11-19 00:02:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409906773] [2024-11-19 00:02:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409906773] [2024-11-19 00:02:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409906773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:55,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784113166] [2024-11-19 00:02:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:55,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:55,708 INFO L87 Difference]: Start difference. First operand has 310 states, 222 states have (on average 1.5) internal successors, (333), 223 states have internal predecessors, (333), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:02:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:55,866 INFO L93 Difference]: Finished difference Result 613 states and 1085 transitions. [2024-11-19 00:02:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:55,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 563 [2024-11-19 00:02:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:55,885 INFO L225 Difference]: With dead ends: 613 [2024-11-19 00:02:55,885 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 00:02:55,894 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:02:55,899 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 353 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 480 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:55,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 480 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 00:02:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-19 00:02:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.4840182648401827) internal successors, (325), 219 states have internal predecessors, (325), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:02:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 495 transitions. [2024-11-19 00:02:55,977 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 495 transitions. Word has length 563 [2024-11-19 00:02:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 495 transitions. [2024-11-19 00:02:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:02:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 495 transitions. [2024-11-19 00:02:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:02:55,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:55,992 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:55,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 00:02:55,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:55,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -421129490, now seen corresponding path program 1 times [2024-11-19 00:02:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713422874] [2024-11-19 00:02:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713422874] [2024-11-19 00:02:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713422874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721893519] [2024-11-19 00:02:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:56,529 INFO L87 Difference]: Start difference. First operand 306 states and 495 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:56,625 INFO L93 Difference]: Finished difference Result 911 states and 1477 transitions. [2024-11-19 00:02:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:02:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:56,635 INFO L225 Difference]: With dead ends: 911 [2024-11-19 00:02:56,635 INFO L226 Difference]: Without dead ends: 608 [2024-11-19 00:02:56,637 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:02:56,638 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 455 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:56,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1372 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-19 00:02:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2024-11-19 00:02:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 432 states have (on average 1.4814814814814814) internal successors, (640), 432 states have internal predecessors, (640), 170 states have call successors, (170), 2 states have call predecessors, (170), 2 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-19 00:02:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 980 transitions. [2024-11-19 00:02:56,712 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 980 transitions. Word has length 563 [2024-11-19 00:02:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:56,714 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 980 transitions. [2024-11-19 00:02:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 980 transitions. [2024-11-19 00:02:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:02:56,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:56,722 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:02:56,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1796500908, now seen corresponding path program 1 times [2024-11-19 00:02:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139283199] [2024-11-19 00:02:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:57,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139283199] [2024-11-19 00:02:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139283199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093452498] [2024-11-19 00:02:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:57,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:57,362 INFO L87 Difference]: Start difference. First operand 605 states and 980 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:57,399 INFO L93 Difference]: Finished difference Result 1209 states and 1961 transitions. [2024-11-19 00:02:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:02:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:57,407 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 00:02:57,407 INFO L226 Difference]: Without dead ends: 607 [2024-11-19 00:02:57,411 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:02:57,412 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:57,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 982 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-19 00:02:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-11-19 00:02:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 434 states have (on average 1.4792626728110598) internal successors, (642), 434 states have internal predecessors, (642), 170 states have call successors, (170), 2 states have call predecessors, (170), 2 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-19 00:02:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 982 transitions. [2024-11-19 00:02:57,475 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 982 transitions. Word has length 563 [2024-11-19 00:02:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:57,476 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 982 transitions. [2024-11-19 00:02:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 982 transitions. [2024-11-19 00:02:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:02:57,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:57,485 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:57,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:02:57,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -559304342, now seen corresponding path program 1 times [2024-11-19 00:02:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532235554] [2024-11-19 00:02:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:57,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:58,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532235554] [2024-11-19 00:02:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532235554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:58,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827590700] [2024-11-19 00:02:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:58,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:58,311 INFO L87 Difference]: Start difference. First operand 607 states and 982 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:58,483 INFO L93 Difference]: Finished difference Result 1488 states and 2397 transitions. [2024-11-19 00:02:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:58,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:02:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:58,490 INFO L225 Difference]: With dead ends: 1488 [2024-11-19 00:02:58,491 INFO L226 Difference]: Without dead ends: 884 [2024-11-19 00:02:58,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:58,497 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 201 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:58,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 924 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-19 00:02:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 880. [2024-11-19 00:02:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 697 states have (on average 1.5164992826398853) internal successors, (1057), 699 states have internal predecessors, (1057), 178 states have call successors, (178), 4 states have call predecessors, (178), 4 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-19 00:02:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1413 transitions. [2024-11-19 00:02:58,558 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1413 transitions. Word has length 563 [2024-11-19 00:02:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1413 transitions. [2024-11-19 00:02:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1413 transitions. [2024-11-19 00:02:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:02:58,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:58,567 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:02:58,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1686275112, now seen corresponding path program 1 times [2024-11-19 00:02:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78688722] [2024-11-19 00:02:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78688722] [2024-11-19 00:03:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78688722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:00,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:00,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:03:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088144035] [2024-11-19 00:03:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:00,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:03:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:03:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:00,228 INFO L87 Difference]: Start difference. First operand 880 states and 1413 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:00,489 INFO L93 Difference]: Finished difference Result 2648 states and 4233 transitions. [2024-11-19 00:03:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:00,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:03:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:00,502 INFO L225 Difference]: With dead ends: 2648 [2024-11-19 00:03:00,502 INFO L226 Difference]: Without dead ends: 1771 [2024-11-19 00:03:00,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:03:00,507 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 525 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:00,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1936 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:03:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-11-19 00:03:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1541. [2024-11-19 00:03:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1318 states have (on average 1.5455235204855842) internal successors, (2037), 1324 states have internal predecessors, (2037), 214 states have call successors, (214), 8 states have call predecessors, (214), 8 states have return successors, (214), 208 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-19 00:03:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2465 transitions. [2024-11-19 00:03:00,604 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2465 transitions. Word has length 563 [2024-11-19 00:03:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2465 transitions. [2024-11-19 00:03:00,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2465 transitions. [2024-11-19 00:03:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:03:00,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:00,610 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:00,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:03:00,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:00,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 788881834, now seen corresponding path program 1 times [2024-11-19 00:03:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022736266] [2024-11-19 00:03:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022736266] [2024-11-19 00:03:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022736266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:03:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662209899] [2024-11-19 00:03:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:01,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:03:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:03:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:01,597 INFO L87 Difference]: Start difference. First operand 1541 states and 2465 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:01,960 INFO L93 Difference]: Finished difference Result 3961 states and 6316 transitions. [2024-11-19 00:03:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:03:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:01,971 INFO L225 Difference]: With dead ends: 3961 [2024-11-19 00:03:01,971 INFO L226 Difference]: Without dead ends: 2279 [2024-11-19 00:03:01,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:01,976 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 757 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:01,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1974 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:03:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2024-11-19 00:03:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1601. [2024-11-19 00:03:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1378 states have (on average 1.5384615384615385) internal successors, (2120), 1384 states have internal predecessors, (2120), 214 states have call successors, (214), 8 states have call predecessors, (214), 8 states have return successors, (214), 208 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-19 00:03:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2548 transitions. [2024-11-19 00:03:02,058 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2548 transitions. Word has length 563 [2024-11-19 00:03:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:02,058 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2548 transitions. [2024-11-19 00:03:02,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2548 transitions. [2024-11-19 00:03:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:03:02,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:02,063 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:02,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:03:02,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:02,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1110781718, now seen corresponding path program 1 times [2024-11-19 00:03:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227362555] [2024-11-19 00:03:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227362555] [2024-11-19 00:03:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227362555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:03:03,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097925726] [2024-11-19 00:03:03,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:03,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:03:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:03,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:03:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:03,288 INFO L87 Difference]: Start difference. First operand 1601 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:03,512 INFO L93 Difference]: Finished difference Result 4182 states and 6633 transitions. [2024-11-19 00:03:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:03:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:03:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:03,524 INFO L225 Difference]: With dead ends: 4182 [2024-11-19 00:03:03,524 INFO L226 Difference]: Without dead ends: 2492 [2024-11-19 00:03:03,530 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:03:03,532 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 456 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:03,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1367 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:03:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-11-19 00:03:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 1261. [2024-11-19 00:03:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1076 states have (on average 1.5408921933085502) internal successors, (1658), 1078 states have internal predecessors, (1658), 178 states have call successors, (178), 6 states have call predecessors, (178), 6 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-19 00:03:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 2014 transitions. [2024-11-19 00:03:03,654 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 2014 transitions. Word has length 563 [2024-11-19 00:03:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:03,655 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 2014 transitions. [2024-11-19 00:03:03,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2014 transitions. [2024-11-19 00:03:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-19 00:03:03,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:03,660 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:03:03,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:03,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 150135532, now seen corresponding path program 1 times [2024-11-19 00:03:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246838738] [2024-11-19 00:03:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246838738] [2024-11-19 00:03:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246838738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:05,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:05,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:03:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933575220] [2024-11-19 00:03:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:03:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:03:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:05,175 INFO L87 Difference]: Start difference. First operand 1261 states and 2014 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:05,858 INFO L93 Difference]: Finished difference Result 3922 states and 6267 transitions. [2024-11-19 00:03:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:05,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2024-11-19 00:03:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:05,874 INFO L225 Difference]: With dead ends: 3922 [2024-11-19 00:03:05,874 INFO L226 Difference]: Without dead ends: 2560 [2024-11-19 00:03:05,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:03:05,880 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 667 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:05,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1964 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:03:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2024-11-19 00:03:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2174. [2024-11-19 00:03:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1813 states have (on average 1.5311638168781025) internal successors, (2776), 1819 states have internal predecessors, (2776), 348 states have call successors, (348), 12 states have call predecessors, (348), 12 states have return successors, (348), 342 states have call predecessors, (348), 348 states have call successors, (348) [2024-11-19 00:03:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3472 transitions. [2024-11-19 00:03:06,036 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3472 transitions. Word has length 563 [2024-11-19 00:03:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:06,037 INFO L471 AbstractCegarLoop]: Abstraction has 2174 states and 3472 transitions. [2024-11-19 00:03:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3472 transitions. [2024-11-19 00:03:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-11-19 00:03:06,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:06,043 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:06,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:03:06,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:06,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1701629966, now seen corresponding path program 1 times [2024-11-19 00:03:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956215813] [2024-11-19 00:03:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:11,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956215813] [2024-11-19 00:03:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956215813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:11,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:03:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203720612] [2024-11-19 00:03:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:03:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:03:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:03:11,212 INFO L87 Difference]: Start difference. First operand 2174 states and 3472 transitions. Second operand has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2024-11-19 00:03:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:14,195 INFO L93 Difference]: Finished difference Result 8006 states and 12638 transitions. [2024-11-19 00:03:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:03:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) Word has length 564 [2024-11-19 00:03:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:14,221 INFO L225 Difference]: With dead ends: 8006 [2024-11-19 00:03:14,221 INFO L226 Difference]: Without dead ends: 5835 [2024-11-19 00:03:14,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:03:14,231 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 2701 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:14,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 4561 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 00:03:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2024-11-19 00:03:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 4427. [2024-11-19 00:03:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 3706 states have (on average 1.5369670804101456) internal successors, (5696), 3718 states have internal predecessors, (5696), 696 states have call successors, (696), 24 states have call predecessors, (696), 24 states have return successors, (696), 684 states have call predecessors, (696), 696 states have call successors, (696) [2024-11-19 00:03:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 7088 transitions. [2024-11-19 00:03:14,553 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 7088 transitions. Word has length 564 [2024-11-19 00:03:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:14,554 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 7088 transitions. [2024-11-19 00:03:14,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2024-11-19 00:03:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 7088 transitions. [2024-11-19 00:03:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-11-19 00:03:14,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:14,560 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:14,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:03:14,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:14,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash -315426572, now seen corresponding path program 1 times [2024-11-19 00:03:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956708180] [2024-11-19 00:03:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956708180] [2024-11-19 00:03:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956708180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:03:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168149607] [2024-11-19 00:03:26,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:26,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:03:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:03:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:26,697 INFO L87 Difference]: Start difference. First operand 4427 states and 7088 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:27,564 INFO L93 Difference]: Finished difference Result 10282 states and 16245 transitions. [2024-11-19 00:03:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 564 [2024-11-19 00:03:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:27,600 INFO L225 Difference]: With dead ends: 10282 [2024-11-19 00:03:27,600 INFO L226 Difference]: Without dead ends: 5858 [2024-11-19 00:03:27,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:03:27,616 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 293 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:27,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1736 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:03:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2024-11-19 00:03:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4975. [2024-11-19 00:03:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4236 states have (on average 1.5415486307837583) internal successors, (6530), 4249 states have internal predecessors, (6530), 698 states have call successors, (698), 40 states have call predecessors, (698), 40 states have return successors, (698), 685 states have call predecessors, (698), 698 states have call successors, (698) [2024-11-19 00:03:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 7926 transitions. [2024-11-19 00:03:28,019 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 7926 transitions. Word has length 564 [2024-11-19 00:03:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:28,020 INFO L471 AbstractCegarLoop]: Abstraction has 4975 states and 7926 transitions. [2024-11-19 00:03:28,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 7926 transitions. [2024-11-19 00:03:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-11-19 00:03:28,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:28,029 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:03:28,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:28,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 349354032, now seen corresponding path program 1 times [2024-11-19 00:03:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:28,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316177335] [2024-11-19 00:03:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316177335] [2024-11-19 00:03:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316177335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:57,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:57,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:03:57,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452144395] [2024-11-19 00:03:57,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:57,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:03:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:03:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:57,370 INFO L87 Difference]: Start difference. First operand 4975 states and 7926 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:57,981 INFO L93 Difference]: Finished difference Result 10714 states and 16933 transitions. [2024-11-19 00:03:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 564 [2024-11-19 00:03:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:58,003 INFO L225 Difference]: With dead ends: 10714 [2024-11-19 00:03:58,003 INFO L226 Difference]: Without dead ends: 5746 [2024-11-19 00:03:58,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:03:58,015 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 284 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:58,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1588 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:03:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2024-11-19 00:03:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 4495. [2024-11-19 00:03:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4495 states, 3756 states have (on average 1.52555910543131) internal successors, (5730), 3769 states have internal predecessors, (5730), 698 states have call successors, (698), 40 states have call predecessors, (698), 40 states have return successors, (698), 685 states have call predecessors, (698), 698 states have call successors, (698) [2024-11-19 00:03:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 4495 states and 7126 transitions. [2024-11-19 00:03:58,298 INFO L78 Accepts]: Start accepts. Automaton has 4495 states and 7126 transitions. Word has length 564 [2024-11-19 00:03:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:58,299 INFO L471 AbstractCegarLoop]: Abstraction has 4495 states and 7126 transitions. [2024-11-19 00:03:58,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4495 states and 7126 transitions. [2024-11-19 00:03:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2024-11-19 00:03:58,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:58,305 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:58,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:03:58,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2034727759, now seen corresponding path program 1 times [2024-11-19 00:03:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370217152] [2024-11-19 00:03:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:04:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat