./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_variablewrapping_wrapper-s_file-8.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 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:07:07,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:07:07,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:07:07,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:07:07,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:07:07,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:07:07,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:07:07,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:07:07,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:07:07,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:07:07,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:07:07,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:07:07,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:07:07,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:07:07,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:07:07,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:07:07,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:07:07,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:07:07,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:07:07,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:07:07,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:07:07,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:07:07,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:07:07,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:07:07,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:07:07,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:07:07,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:07:07,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:07:07,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:07:07,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:07:07,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:07:07,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:07:07,391 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 -> 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 [2024-11-09 02:07:07,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:07:07,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:07:07,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:07:07,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:07:07,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:07:07,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-11-09 02:07:08,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:07:08,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:07:08,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-11-09 02:07:08,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f445f4eb/1a76cca3d0e84a5c96e1fddbc5232e5b/FLAG41ab85dc6 [2024-11-09 02:07:09,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f445f4eb/1a76cca3d0e84a5c96e1fddbc5232e5b [2024-11-09 02:07:09,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:07:09,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:07:09,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:07:09,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:07:09,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:07:09,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156558a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09, skipping insertion in model container [2024-11-09 02:07:09,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:07:09,583 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_variablewrapping_wrapper-s_file-8.i[915,928] [2024-11-09 02:07:09,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:07:09,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:07:09,676 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_variablewrapping_wrapper-s_file-8.i[915,928] [2024-11-09 02:07:09,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:07:09,752 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:07:09,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09 WrapperNode [2024-11-09 02:07:09,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:07:09,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:07:09,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:07:09,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:07:09,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,802 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-09 02:07:09,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:07:09,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:07:09,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:07:09,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:07:09,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,828 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:07:09,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:07:09,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:07:09,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:07:09,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:07:09,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (1/1) ... [2024-11-09 02:07:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:07:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:07:09,890 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-09 02:07:09,896 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-09 02:07:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:07:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:07:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:07:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:07:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:07:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:07:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:07:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:07:09,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:07:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:07:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:07:09,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:07:10,015 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:07:10,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:07:10,421 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 02:07:10,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:07:10,433 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:07:10,434 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:07:10,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:07:10 BoogieIcfgContainer [2024-11-09 02:07:10,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:07:10,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:07:10,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:07:10,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:07:10,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:07:09" (1/3) ... [2024-11-09 02:07:10,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd0b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:07:10, skipping insertion in model container [2024-11-09 02:07:10,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:07:09" (2/3) ... [2024-11-09 02:07:10,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd0b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:07:10, skipping insertion in model container [2024-11-09 02:07:10,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:07:10" (3/3) ... [2024-11-09 02:07:10,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-8.i [2024-11-09 02:07:10,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:07:10,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:07:10,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:07:10,501 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;@409df36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:07:10,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:07:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:10,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:10,516 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:10,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1431925537, now seen corresponding path program 1 times [2024-11-09 02:07:10,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:10,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147253978] [2024-11-09 02:07:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147253978] [2024-11-09 02:07:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147253978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:10,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:07:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742756867] [2024-11-09 02:07:10,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:07:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:10,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:07:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:07:10,904 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:10,925 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-09 02:07:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:07:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 02:07:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:10,932 INFO L225 Difference]: With dead ends: 193 [2024-11-09 02:07:10,932 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 02:07:10,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:07:10,937 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:10,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:07:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 02:07:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 02:07:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 02:07:10,967 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-09 02:07:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:10,968 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 02:07:10,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 02:07:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:10,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:10,970 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:10,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:07:10,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2107248781, now seen corresponding path program 1 times [2024-11-09 02:07:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:10,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602915796] [2024-11-09 02:07:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602915796] [2024-11-09 02:07:11,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602915796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:11,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:11,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:07:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329109505] [2024-11-09 02:07:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:11,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:07:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:07:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,285 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:11,332 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-09 02:07:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:07:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 02:07:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:11,334 INFO L225 Difference]: With dead ends: 191 [2024-11-09 02:07:11,334 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 02:07:11,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,335 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:11,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:07:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 02:07:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 02:07:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 02:07:11,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-09 02:07:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:11,346 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 02:07:11,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 02:07:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:11,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:11,347 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:11,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:07:11,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 568908751, now seen corresponding path program 1 times [2024-11-09 02:07:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600675747] [2024-11-09 02:07:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600675747] [2024-11-09 02:07:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600675747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:07:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937558063] [2024-11-09 02:07:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:11,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:07:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:07:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,588 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:11,617 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-09 02:07:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:07:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:07:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:11,619 INFO L225 Difference]: With dead ends: 196 [2024-11-09 02:07:11,619 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 02:07:11,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,621 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:11,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:07:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 02:07:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-09 02:07:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-09 02:07:11,628 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-09 02:07:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:11,628 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-09 02:07:11,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-09 02:07:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:11,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:11,630 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:07:11,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1248967121, now seen corresponding path program 1 times [2024-11-09 02:07:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320634783] [2024-11-09 02:07:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:11,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320634783] [2024-11-09 02:07:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320634783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:07:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758532352] [2024-11-09 02:07:11,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:11,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:07:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:07:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,834 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:11,862 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-09 02:07:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:07:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:07:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:11,867 INFO L225 Difference]: With dead ends: 200 [2024-11-09 02:07:11,867 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 02:07:11,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:07:11,868 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:11,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:07:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 02:07:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-09 02:07:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-09 02:07:11,875 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-09 02:07:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-09 02:07:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-09 02:07:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:11,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:11,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:11,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:07:11,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1270992813, now seen corresponding path program 1 times [2024-11-09 02:07:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628799937] [2024-11-09 02:07:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628799937] [2024-11-09 02:07:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628799937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:07:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848659741] [2024-11-09 02:07:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:07:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:07:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:07:12,601 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:12,889 INFO L93 Difference]: Finished difference Result 201 states and 285 transitions. [2024-11-09 02:07:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:07:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 02:07:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:12,891 INFO L225 Difference]: With dead ends: 201 [2024-11-09 02:07:12,891 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 02:07:12,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:07:12,892 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 118 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:12,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 222 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:07:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 02:07:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 02:07:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:07:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-09 02:07:12,904 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-09 02:07:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-09 02:07:12,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-09 02:07:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:07:12,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:12,909 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:12,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:07:12,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:12,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1335030741, now seen corresponding path program 1 times [2024-11-09 02:07:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:12,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096182526] [2024-11-09 02:07:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096182526] [2024-11-09 02:07:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096182526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:07:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59749590] [2024-11-09 02:07:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:07:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:07:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:07:14,217 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:07:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:14,618 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2024-11-09 02:07:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:07:14,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2024-11-09 02:07:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:14,621 INFO L225 Difference]: With dead ends: 253 [2024-11-09 02:07:14,621 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 02:07:14,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:07:14,623 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:14,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:07:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 02:07:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-09 02:07:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.3203125) internal successors, (169), 129 states have internal predecessors, (169), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:07:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 209 transitions. [2024-11-09 02:07:14,645 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 209 transitions. Word has length 123 [2024-11-09 02:07:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:14,646 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 209 transitions. [2024-11-09 02:07:14,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:07:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 209 transitions. [2024-11-09 02:07:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:07:14,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:14,648 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:14,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:07:14,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:14,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 375638192, now seen corresponding path program 1 times [2024-11-09 02:07:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581228149] [2024-11-09 02:07:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581228149] [2024-11-09 02:07:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581228149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:07:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722233151] [2024-11-09 02:07:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:07:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:07:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:07:15,360 INFO L87 Difference]: Start difference. First operand 151 states and 209 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:15,944 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2024-11-09 02:07:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:07:15,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:07:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:15,946 INFO L225 Difference]: With dead ends: 345 [2024-11-09 02:07:15,946 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 02:07:15,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:07:15,947 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 314 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:15,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 463 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:07:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 02:07:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2024-11-09 02:07:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 162 states have internal predecessors, (213), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:07:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2024-11-09 02:07:15,961 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 125 [2024-11-09 02:07:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:15,961 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2024-11-09 02:07:15,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:07:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2024-11-09 02:07:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:07:15,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:15,963 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:15,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:07:15,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:15,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665936, now seen corresponding path program 1 times [2024-11-09 02:07:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167942018] [2024-11-09 02:07:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:07:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:07:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:07:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:07:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:07:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:07:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:07:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:07:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:07:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:07:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:07:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:07:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:07:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:07:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:07:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:07:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:07:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167942018] [2024-11-09 02:07:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167942018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:07:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:07:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:07:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349610568] [2024-11-09 02:07:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:07:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:07:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:07:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:07:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:07:16,764 INFO L87 Difference]: Start difference. First operand 193 states and 269 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:07:17,756 INFO L93 Difference]: Finished difference Result 381 states and 529 transitions. [2024-11-09 02:07:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:07:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-09 02:07:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:07:17,758 INFO L225 Difference]: With dead ends: 381 [2024-11-09 02:07:17,758 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 02:07:17,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:07:17,759 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 565 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:07:17,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 369 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:07:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 02:07:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-11-09 02:07:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:07:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2024-11-09 02:07:17,776 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 125 [2024-11-09 02:07:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:07:17,776 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2024-11-09 02:07:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:07:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2024-11-09 02:07:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:07:17,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:07:17,778 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:07:17,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:07:17,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:07:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:07:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1444028551, now seen corresponding path program 1 times [2024-11-09 02:07:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:07:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165079287] [2024-11-09 02:07:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:07:17,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:07:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:08:16,715 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 02:08:25,705 WARN L286 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 02:08:32,371 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 02:08:39,223 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)