./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.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 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:56:03,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:56:03,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:56:03,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:56:03,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:56:03,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:56:03,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:56:03,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:56:03,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:56:03,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:56:03,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:56:03,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:56:03,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:56:03,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:56:03,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:56:03,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:56:03,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:56:03,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:56:03,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:56:03,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:56:03,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:56:03,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:56:03,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:56:03,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:56:03,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:56:03,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:56:03,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:56:03,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:56:03,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:56:03,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:56:03,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:56:03,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:56:03,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:03,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:56:03,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:56:03,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:56:03,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:56:03,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:56:03,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:56:03,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:56:03,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:56:03,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:56:03,500 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 -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 [2024-11-20 02:56:03,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:56:03,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:56:03,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:56:03,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:56:03,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:56:03,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-20 02:56:05,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:56:05,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:56:05,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-20 02:56:05,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29690f773/b2248e2e0fef4ae0ba37d3379cb80939/FLAGa76cf8e72 [2024-11-20 02:56:05,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29690f773/b2248e2e0fef4ae0ba37d3379cb80939 [2024-11-20 02:56:05,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:56:05,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:56:05,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:05,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:56:05,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:56:05,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:05" (1/1) ... [2024-11-20 02:56:05,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae19ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:05, skipping insertion in model container [2024-11-20 02:56:05,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:05" (1/1) ... [2024-11-20 02:56:05,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:56:06,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-11-20 02:56:06,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:06,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:56:06,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-11-20 02:56:06,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:06,202 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:56:06,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06 WrapperNode [2024-11-20 02:56:06,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:06,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:06,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:56:06,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:56:06,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,279 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-20 02:56:06,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:06,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:56:06,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:56:06,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:56:06,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:56:06,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:56:06,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:56:06,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:56:06,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:56:06,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (1/1) ... [2024-11-20 02:56:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:06,391 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-20 02:56:06,392 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-20 02:56:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:56:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:56:06,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:56:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:56:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:56:06,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:56:06,507 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:56:06,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:56:06,819 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 02:56:06,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:56:06,835 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:56:06,835 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:56:06,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:06 BoogieIcfgContainer [2024-11-20 02:56:06,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:56:06,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:56:06,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:56:06,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:56:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:05" (1/3) ... [2024-11-20 02:56:06,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191ecf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:06, skipping insertion in model container [2024-11-20 02:56:06,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:06" (2/3) ... [2024-11-20 02:56:06,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191ecf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:06, skipping insertion in model container [2024-11-20 02:56:06,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:06" (3/3) ... [2024-11-20 02:56:06,846 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-20 02:56:06,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:56:06,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:56:06,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:56:06,926 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;@d390a9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:56:06,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:56:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 02:56:06,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:06,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:06,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:06,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1399999483, now seen corresponding path program 1 times [2024-11-20 02:56:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702826431] [2024-11-20 02:56:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702826431] [2024-11-20 02:56:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702826431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:56:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862029394] [2024-11-20 02:56:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:07,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:56:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:56:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:56:07,401 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:07,433 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-20 02:56:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:56:07,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-20 02:56:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:07,443 INFO L225 Difference]: With dead ends: 103 [2024-11-20 02:56:07,443 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 02:56:07,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-20 02:56:07,453 INFO L432 NwaCegarLoop]: 75 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, 75 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-20 02:56:07,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 02:56:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 02:56:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-20 02:56:07,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2024-11-20 02:56:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:07,503 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-20 02:56:07,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-20 02:56:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 02:56:07,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:07,510 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:56:07,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1736788935, now seen corresponding path program 1 times [2024-11-20 02:56:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238120106] [2024-11-20 02:56:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:07,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238120106] [2024-11-20 02:56:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238120106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:07,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:07,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:56:07,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877287163] [2024-11-20 02:56:07,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:07,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:56:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:07,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:56:07,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:56:07,968 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:08,179 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2024-11-20 02:56:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:56:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-20 02:56:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:08,182 INFO L225 Difference]: With dead ends: 148 [2024-11-20 02:56:08,183 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 02:56:08,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:56:08,186 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:08,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:56:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 02:56:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2024-11-20 02:56:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 02:56:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-20 02:56:08,210 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2024-11-20 02:56:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:08,210 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-20 02:56:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-20 02:56:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 02:56:08,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:08,214 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:56:08,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 725671685, now seen corresponding path program 1 times [2024-11-20 02:56:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844729915] [2024-11-20 02:56:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844729915] [2024-11-20 02:56:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844729915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:56:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996121202] [2024-11-20 02:56:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:56:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:56:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:56:12,416 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:13,488 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2024-11-20 02:56:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:56:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-20 02:56:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:13,492 INFO L225 Difference]: With dead ends: 204 [2024-11-20 02:56:13,492 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 02:56:13,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-20 02:56:13,516 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 497 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:56:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 02:56:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97. [2024-11-20 02:56:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 02:56:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-20 02:56:13,539 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2024-11-20 02:56:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-20 02:56:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-20 02:56:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 02:56:13,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:13,542 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:56:13,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1426736263, now seen corresponding path program 1 times [2024-11-20 02:56:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473319872] [2024-11-20 02:56:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473319872] [2024-11-20 02:56:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473319872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:13,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799307229] [2024-11-20 02:56:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:13,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:13,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:13,625 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:13,667 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2024-11-20 02:56:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:13,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-20 02:56:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:13,671 INFO L225 Difference]: With dead ends: 192 [2024-11-20 02:56:13,673 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 02:56:13,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:13,674 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:13,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 02:56:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-20 02:56:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:56:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2024-11-20 02:56:13,697 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2024-11-20 02:56:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:13,697 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2024-11-20 02:56:13,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2024-11-20 02:56:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 02:56:13,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:13,702 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:13,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:56:13,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:13,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 862330139, now seen corresponding path program 1 times [2024-11-20 02:56:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467109535] [2024-11-20 02:56:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467109535] [2024-11-20 02:56:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467109535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:13,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:56:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933020782] [2024-11-20 02:56:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:13,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:56:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:13,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:56:13,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:56:13,941 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:13,980 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2024-11-20 02:56:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:56:13,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-20 02:56:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:13,982 INFO L225 Difference]: With dead ends: 247 [2024-11-20 02:56:13,982 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 02:56:13,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:56:13,984 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:13,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 02:56:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-11-20 02:56:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:56:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2024-11-20 02:56:13,999 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 102 [2024-11-20 02:56:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:14,000 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2024-11-20 02:56:14,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2024-11-20 02:56:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 02:56:14,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:14,002 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:14,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:56:14,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1657629795, now seen corresponding path program 1 times [2024-11-20 02:56:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528491523] [2024-11-20 02:56:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:21,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528491523] [2024-11-20 02:56:21,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528491523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:21,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:56:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775390878] [2024-11-20 02:56:21,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:21,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:56:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:56:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:21,167 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:25,060 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-11-20 02:56:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:56:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-20 02:56:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:25,062 INFO L225 Difference]: With dead ends: 197 [2024-11-20 02:56:25,062 INFO L226 Difference]: Without dead ends: 195 [2024-11-20 02:56:25,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2024-11-20 02:56:25,064 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:25,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 489 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 02:56:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-20 02:56:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2024-11-20 02:56:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:56:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-20 02:56:25,079 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 102 [2024-11-20 02:56:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-20 02:56:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-20 02:56:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 02:56:25,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:25,081 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:25,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:56:25,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1074487553, now seen corresponding path program 1 times [2024-11-20 02:56:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912795992] [2024-11-20 02:56:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912795992] [2024-11-20 02:56:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912795992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:56:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114138902] [2024-11-20 02:56:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:56:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:56:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:56:27,801 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:28,705 INFO L93 Difference]: Finished difference Result 195 states and 263 transitions. [2024-11-20 02:56:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:56:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-20 02:56:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:28,707 INFO L225 Difference]: With dead ends: 195 [2024-11-20 02:56:28,707 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 02:56:28,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-20 02:56:28,709 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 268 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:28,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 428 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:56:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 02:56:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2024-11-20 02:56:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:56:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2024-11-20 02:56:28,734 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2024-11-20 02:56:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2024-11-20 02:56:28,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2024-11-20 02:56:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 02:56:28,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:28,739 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:56:28,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2101752518, now seen corresponding path program 1 times [2024-11-20 02:56:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968561735] [2024-11-20 02:56:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968561735] [2024-11-20 02:56:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968561735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:56:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865575750] [2024-11-20 02:56:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:56:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:56:37,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:37,423 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:45,078 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions. [2024-11-20 02:56:45,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:56:45,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-20 02:56:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:45,080 INFO L225 Difference]: With dead ends: 211 [2024-11-20 02:56:45,080 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 02:56:45,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2024-11-20 02:56:45,081 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 220 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:45,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 417 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 02:56:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 02:56:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2024-11-20 02:56:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:56:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-20 02:56:45,095 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-20 02:56:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-20 02:56:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-20 02:56:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 02:56:45,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:45,097 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:56:45,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:56:45,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:45,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1421694148, now seen corresponding path program 1 times [2024-11-20 02:56:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135587470] [2024-11-20 02:56:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:56:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:56:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:56:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135587470] [2024-11-20 02:56:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135587470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:56:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47194690] [2024-11-20 02:56:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:52,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:56:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:56:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:52,696 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:00,604 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2024-11-20 02:57:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:57:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-20 02:57:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:00,607 INFO L225 Difference]: With dead ends: 207 [2024-11-20 02:57:00,607 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 02:57:00,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2024-11-20 02:57:00,608 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:00,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 450 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 02:57:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 02:57:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2024-11-20 02:57:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:57:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-20 02:57:00,628 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-20 02:57:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-20 02:57:00,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-20 02:57:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 02:57:00,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:00,632 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:57:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:57:00,632 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 206585705, now seen corresponding path program 1 times [2024-11-20 02:57:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707371997] [2024-11-20 02:57:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:57:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:57:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:57:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:05,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707371997] [2024-11-20 02:57:05,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707371997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:05,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:05,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:57:05,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53580918] [2024-11-20 02:57:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:05,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:57:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:05,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:57:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:57:05,893 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:08,462 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2024-11-20 02:57:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 02:57:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-20 02:57:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:08,464 INFO L225 Difference]: With dead ends: 195 [2024-11-20 02:57:08,464 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 02:57:08,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2024-11-20 02:57:08,465 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 238 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:08,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 404 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 02:57:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 02:57:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2024-11-20 02:57:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 101 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:57:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-20 02:57:08,477 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 103 [2024-11-20 02:57:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:08,477 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-20 02:57:08,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-20 02:57:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 02:57:08,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:08,479 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:57:08,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:57:08,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:08,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash 886533128, now seen corresponding path program 1 times [2024-11-20 02:57:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362805116] [2024-11-20 02:57:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:57:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:57:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:57:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362805116] [2024-11-20 02:57:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362805116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-20 02:57:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439145648] [2024-11-20 02:57:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 02:57:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 02:57:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-20 02:57:15,583 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 02:57:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:20,217 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2024-11-20 02:57:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 02:57:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-20 02:57:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:20,219 INFO L225 Difference]: With dead ends: 213 [2024-11-20 02:57:20,219 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 02:57:20,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 02:57:20,220 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 369 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:20,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 418 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 02:57:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 02:57:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-11-20 02:57:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 02:57:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-20 02:57:20,240 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 103 [2024-11-20 02:57:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:20,241 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-20 02:57:20,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 02:57:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-20 02:57:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 02:57:20,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:20,242 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:57:20,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:57:20,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:20,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash -674469778, now seen corresponding path program 1 times [2024-11-20 02:57:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629475982] [2024-11-20 02:57:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:20,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:57:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:57:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:57:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629475982] [2024-11-20 02:57:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629475982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-20 02:57:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583118075] [2024-11-20 02:57:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 02:57:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 02:57:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-20 02:57:27,111 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)