./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.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 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:20:53,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:20:54,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:20:54,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:20:54,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:20:54,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:20:54,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:20:54,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:20:54,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:20:54,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:20:54,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:20:54,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:20:54,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:20:54,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:20:54,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:20:54,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:20:54,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:20:54,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:20:54,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:20:54,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:20:54,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:20:54,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:20:54,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:20:54,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:20:54,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:20:54,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:20:54,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:20:54,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:20:54,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:20:54,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:20:54,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:20:54,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:20:54,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:20:54,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:20:54,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:20:54,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:20:54,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:20:54,058 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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2024-11-19 01:20:54,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:20:54,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:20:54,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:20:54,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:20:54,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:20:54,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-19 01:20:55,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:20:56,130 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:20:56,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-19 01:20:56,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06035d6b7/dc7d7b0ac91847638233ab610b5773ad/FLAGa5a84bade [2024-11-19 01:20:56,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06035d6b7/dc7d7b0ac91847638233ab610b5773ad [2024-11-19 01:20:56,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:20:56,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:20:56,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:20:56,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:20:56,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:20:56,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:56,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd94389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56, skipping insertion in model container [2024-11-19 01:20:56,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:56,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:20:56,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-11-19 01:20:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:20:56,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:20:56,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-11-19 01:20:56,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:20:56,962 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:20:56,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56 WrapperNode [2024-11-19 01:20:56,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:20:56,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:20:56,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:20:56,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:20:56,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:56,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,064 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-11-19 01:20:57,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:20:57,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:20:57,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:20:57,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:20:57,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,160 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-19 01:20:57,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:20:57,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:20:57,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:20:57,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:20:57,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (1/1) ... [2024-11-19 01:20:57,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:20:57,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:20:57,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:20:57,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:20:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:20:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 01:20:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 01:20:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:20:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:20:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:20:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:20:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:20:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:20:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:20:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:20:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:20:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:20:57,543 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:20:57,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:20:58,082 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-19 01:20:58,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:20:58,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:20:58,101 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:20:58,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:20:58 BoogieIcfgContainer [2024-11-19 01:20:58,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:20:58,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:20:58,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:20:58,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:20:58,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:20:56" (1/3) ... [2024-11-19 01:20:58,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afbd325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:20:58, skipping insertion in model container [2024-11-19 01:20:58,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:56" (2/3) ... [2024-11-19 01:20:58,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afbd325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:20:58, skipping insertion in model container [2024-11-19 01:20:58,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:20:58" (3/3) ... [2024-11-19 01:20:58,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-19 01:20:58,129 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:20:58,129 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:20:58,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:20:58,206 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;@9a6a442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:20:58,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:20:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:20:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:20:58,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:20:58,228 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:20:58,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:20:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:20:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -312506901, now seen corresponding path program 1 times [2024-11-19 01:20:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:20:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967707896] [2024-11-19 01:20:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:20:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 01:20:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:20:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967707896] [2024-11-19 01:20:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967707896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:20:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851903989] [2024-11-19 01:20:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:20:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:20:58,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:20:58,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:20:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:58,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:20:58,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:20:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 01:20:58,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:20:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851903989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:20:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:20:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:20:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196314763] [2024-11-19 01:20:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:20:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:20:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:20:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:20:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:20:58,993 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:20:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:20:59,032 INFO L93 Difference]: Finished difference Result 203 states and 319 transitions. [2024-11-19 01:20:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:20:59,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2024-11-19 01:20:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:20:59,041 INFO L225 Difference]: With dead ends: 203 [2024-11-19 01:20:59,041 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 01:20:59,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:20:59,047 INFO L432 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:20:59,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:20:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 01:20:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 01:20:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:20:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2024-11-19 01:20:59,093 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2024-11-19 01:20:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:20:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2024-11-19 01:20:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:20:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2024-11-19 01:20:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:20:59,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:20:59,101 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:20:59,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:20:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:20:59,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:20:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:20:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 693008529, now seen corresponding path program 1 times [2024-11-19 01:20:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:20:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303540575] [2024-11-19 01:20:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:20:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:20:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:20:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303540575] [2024-11-19 01:20:59,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303540575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:20:59,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:20:59,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:20:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184817293] [2024-11-19 01:20:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:20:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:20:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:20:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:20:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:20:59,646 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:20:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:20:59,702 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-11-19 01:20:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:20:59,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-11-19 01:20:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:20:59,705 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:20:59,706 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 01:20:59,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:20:59,708 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:20:59,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:20:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 01:20:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-19 01:20:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:20:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2024-11-19 01:20:59,723 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2024-11-19 01:20:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:20:59,724 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2024-11-19 01:20:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:20:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2024-11-19 01:20:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:20:59,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:20:59,731 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:20:59,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:20:59,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:20:59,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:20:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1826951405, now seen corresponding path program 1 times [2024-11-19 01:20:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:20:59,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514853275] [2024-11-19 01:20:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:20:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:00,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514853275] [2024-11-19 01:21:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514853275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:21:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653985879] [2024-11-19 01:21:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:00,014 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:00,055 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2024-11-19 01:21:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-11-19 01:21:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:00,063 INFO L225 Difference]: With dead ends: 206 [2024-11-19 01:21:00,066 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:21:00,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:00,068 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:00,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:21:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:21:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:21:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:21:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-11-19 01:21:00,094 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2024-11-19 01:21:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:00,095 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-11-19 01:21:00,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-11-19 01:21:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:21:00,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:00,099 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:00,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:21:00,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:00,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1825104363, now seen corresponding path program 1 times [2024-11-19 01:21:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041575519] [2024-11-19 01:21:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:01,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041575519] [2024-11-19 01:21:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041575519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:01,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:21:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352418844] [2024-11-19 01:21:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:21:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:21:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:01,627 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:02,283 INFO L93 Difference]: Finished difference Result 241 states and 338 transitions. [2024-11-19 01:21:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2024-11-19 01:21:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:02,287 INFO L225 Difference]: With dead ends: 241 [2024-11-19 01:21:02,287 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 01:21:02,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:21:02,289 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:02,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 309 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:21:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 01:21:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2024-11-19 01:21:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-11-19 01:21:02,312 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 144 [2024-11-19 01:21:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:02,313 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-11-19 01:21:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-11-19 01:21:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 01:21:02,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:02,315 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:21:02,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -872708680, now seen corresponding path program 1 times [2024-11-19 01:21:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268676909] [2024-11-19 01:21:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268676909] [2024-11-19 01:21:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268676909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:21:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333665207] [2024-11-19 01:21:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:21:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:03,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:21:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:03,462 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:21:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:04,009 INFO L93 Difference]: Finished difference Result 283 states and 397 transitions. [2024-11-19 01:21:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2024-11-19 01:21:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:04,013 INFO L225 Difference]: With dead ends: 283 [2024-11-19 01:21:04,014 INFO L226 Difference]: Without dead ends: 179 [2024-11-19 01:21:04,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:21:04,015 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 339 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:04,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 332 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:21:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-19 01:21:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2024-11-19 01:21:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.287037037037037) internal successors, (139), 109 states have internal predecessors, (139), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2024-11-19 01:21:04,045 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 145 [2024-11-19 01:21:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:04,046 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2024-11-19 01:21:04,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:21:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2024-11-19 01:21:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:21:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:04,050 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:21:04,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1111641874, now seen corresponding path program 1 times [2024-11-19 01:21:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796891356] [2024-11-19 01:21:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796891356] [2024-11-19 01:21:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796891356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:21:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410833938] [2024-11-19 01:21:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:06,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:21:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:21:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:21:06,844 INFO L87 Difference]: Start difference. First operand 140 states and 197 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:07,661 INFO L93 Difference]: Finished difference Result 304 states and 428 transitions. [2024-11-19 01:21:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:21:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2024-11-19 01:21:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:07,664 INFO L225 Difference]: With dead ends: 304 [2024-11-19 01:21:07,664 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 01:21:07,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-19 01:21:07,665 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 294 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:07,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 576 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:21:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 01:21:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2024-11-19 01:21:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 122 states have internal predecessors, (158), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 216 transitions. [2024-11-19 01:21:07,700 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 216 transitions. Word has length 146 [2024-11-19 01:21:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:07,701 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 216 transitions. [2024-11-19 01:21:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 216 transitions. [2024-11-19 01:21:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:21:07,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:07,704 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:07,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:21:07,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash 704073845, now seen corresponding path program 1 times [2024-11-19 01:21:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:07,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631429959] [2024-11-19 01:21:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:07,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631429959] [2024-11-19 01:21:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631429959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 01:21:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663242616] [2024-11-19 01:21:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:10,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:21:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:21:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:21:10,176 INFO L87 Difference]: Start difference. First operand 153 states and 216 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:11,532 INFO L93 Difference]: Finished difference Result 360 states and 508 transitions. [2024-11-19 01:21:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:21:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2024-11-19 01:21:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:11,534 INFO L225 Difference]: With dead ends: 360 [2024-11-19 01:21:11,534 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 01:21:11,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:21:11,536 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 485 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:11,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 431 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:21:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 01:21:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 188. [2024-11-19 01:21:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 157 states have internal predecessors, (206), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-19 01:21:11,570 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 146 [2024-11-19 01:21:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-19 01:21:11,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-19 01:21:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:21:11,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:11,574 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:11,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:21:11,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1492049167, now seen corresponding path program 1 times [2024-11-19 01:21:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:11,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552716181] [2024-11-19 01:21:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:11,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552716181] [2024-11-19 01:21:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552716181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:21:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867989699] [2024-11-19 01:21:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:12,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:21:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:21:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:12,501 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:12,955 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2024-11-19 01:21:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:21:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2024-11-19 01:21:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:12,958 INFO L225 Difference]: With dead ends: 456 [2024-11-19 01:21:12,958 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 01:21:12,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:21:12,960 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 147 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:12,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 380 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:21:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 01:21:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 204. [2024-11-19 01:21:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 173 states have internal predecessors, (228), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2024-11-19 01:21:12,995 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 146 [2024-11-19 01:21:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:12,996 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2024-11-19 01:21:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2024-11-19 01:21:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:12,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:12,998 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:21:12,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1887079423, now seen corresponding path program 1 times [2024-11-19 01:21:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346013265] [2024-11-19 01:21:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346013265] [2024-11-19 01:21:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346013265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:21:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168319561] [2024-11-19 01:21:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:21:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:21:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:21:16,228 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:17,232 INFO L93 Difference]: Finished difference Result 451 states and 631 transitions. [2024-11-19 01:21:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:21:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2024-11-19 01:21:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:17,234 INFO L225 Difference]: With dead ends: 451 [2024-11-19 01:21:17,234 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 01:21:17,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:21:17,236 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 394 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:17,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 585 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:21:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 01:21:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 206. [2024-11-19 01:21:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 174 states have (on average 1.3275862068965518) internal successors, (231), 175 states have internal predecessors, (231), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:21:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2024-11-19 01:21:17,272 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 147 [2024-11-19 01:21:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:17,275 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2024-11-19 01:21:17,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2024-11-19 01:21:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:17,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:17,278 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:17,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:21:17,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:17,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash -687424559, now seen corresponding path program 1 times [2024-11-19 01:21:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368569468] [2024-11-19 01:21:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368569468] [2024-11-19 01:21:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368569468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:19,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 01:21:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605747843] [2024-11-19 01:21:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:19,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:21:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:21:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:21:19,701 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:21,082 INFO L93 Difference]: Finished difference Result 486 states and 676 transitions. [2024-11-19 01:21:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:21:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2024-11-19 01:21:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:21,085 INFO L225 Difference]: With dead ends: 486 [2024-11-19 01:21:21,085 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 01:21:21,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:21:21,091 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 364 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:21,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 564 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:21:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 01:21:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-11-19 01:21:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 228 states have (on average 1.293859649122807) internal successors, (295), 231 states have internal predecessors, (295), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 01:21:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 385 transitions. [2024-11-19 01:21:21,148 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 385 transitions. Word has length 147 [2024-11-19 01:21:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 385 transitions. [2024-11-19 01:21:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 385 transitions. [2024-11-19 01:21:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:21,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:21,152 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:21:21,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 143568852, now seen corresponding path program 1 times [2024-11-19 01:21:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706935487] [2024-11-19 01:21:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706935487] [2024-11-19 01:21:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706935487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:21:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660912566] [2024-11-19 01:21:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:22,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:21:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:21:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:22,430 INFO L87 Difference]: Start difference. First operand 278 states and 385 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:22,903 INFO L93 Difference]: Finished difference Result 603 states and 834 transitions. [2024-11-19 01:21:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:21:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-11-19 01:21:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:22,907 INFO L225 Difference]: With dead ends: 603 [2024-11-19 01:21:22,907 INFO L226 Difference]: Without dead ends: 349 [2024-11-19 01:21:22,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:21:22,909 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 247 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:22,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 360 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:21:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-19 01:21:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 278. [2024-11-19 01:21:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 228 states have (on average 1.2894736842105263) internal successors, (294), 231 states have internal predecessors, (294), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 01:21:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 384 transitions. [2024-11-19 01:21:22,964 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 384 transitions. Word has length 147 [2024-11-19 01:21:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:22,964 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 384 transitions. [2024-11-19 01:21:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 384 transitions. [2024-11-19 01:21:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:22,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:22,966 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:22,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:21:22,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:22,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash -838220110, now seen corresponding path program 1 times [2024-11-19 01:21:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138641322] [2024-11-19 01:21:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138641322] [2024-11-19 01:21:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138641322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:25,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:25,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:21:25,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543465280] [2024-11-19 01:21:25,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:25,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:21:25,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:25,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:21:25,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:21:25,383 INFO L87 Difference]: Start difference. First operand 278 states and 384 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:26,355 INFO L93 Difference]: Finished difference Result 622 states and 856 transitions. [2024-11-19 01:21:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:21:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2024-11-19 01:21:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:26,361 INFO L225 Difference]: With dead ends: 622 [2024-11-19 01:21:26,361 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 01:21:26,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:21:26,363 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 323 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:26,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 591 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:21:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 01:21:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 308. [2024-11-19 01:21:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 258 states have (on average 1.2945736434108528) internal successors, (334), 261 states have internal predecessors, (334), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 01:21:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 424 transitions. [2024-11-19 01:21:26,429 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 424 transitions. Word has length 147 [2024-11-19 01:21:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:26,430 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 424 transitions. [2024-11-19 01:21:26,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 424 transitions. [2024-11-19 01:21:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:26,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:26,432 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:26,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:21:26,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2118083788, now seen corresponding path program 1 times [2024-11-19 01:21:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856304671] [2024-11-19 01:21:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856304671] [2024-11-19 01:21:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856304671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:31,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 01:21:31,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049057523] [2024-11-19 01:21:31,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:31,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:21:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:31,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:21:31,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:21:31,296 INFO L87 Difference]: Start difference. First operand 308 states and 424 transitions. Second operand has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:33,016 INFO L93 Difference]: Finished difference Result 667 states and 908 transitions. [2024-11-19 01:21:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:21:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 147 [2024-11-19 01:21:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:33,020 INFO L225 Difference]: With dead ends: 667 [2024-11-19 01:21:33,021 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 01:21:33,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:21:33,022 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 247 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:33,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 584 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:21:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 01:21:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 376. [2024-11-19 01:21:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 319 states have (on average 1.2821316614420062) internal successors, (409), 324 states have internal predecessors, (409), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 01:21:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 507 transitions. [2024-11-19 01:21:33,122 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 507 transitions. Word has length 147 [2024-11-19 01:21:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 507 transitions. [2024-11-19 01:21:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 507 transitions. [2024-11-19 01:21:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:33,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:33,127 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:21:33,127 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:33,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -697671500, now seen corresponding path program 1 times [2024-11-19 01:21:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088770564] [2024-11-19 01:21:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:37,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:37,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088770564] [2024-11-19 01:21:37,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088770564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:37,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:37,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 01:21:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346440665] [2024-11-19 01:21:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:37,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:21:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:21:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:21:37,527 INFO L87 Difference]: Start difference. First operand 376 states and 507 transitions. Second operand has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:39,408 INFO L93 Difference]: Finished difference Result 776 states and 1042 transitions. [2024-11-19 01:21:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:21:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 147 [2024-11-19 01:21:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:39,411 INFO L225 Difference]: With dead ends: 776 [2024-11-19 01:21:39,411 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 01:21:39,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:21:39,413 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 248 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:39,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 515 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:21:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 01:21:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 357. [2024-11-19 01:21:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 302 states have (on average 1.2748344370860927) internal successors, (385), 306 states have internal predecessors, (385), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 01:21:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 479 transitions. [2024-11-19 01:21:39,496 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 479 transitions. Word has length 147 [2024-11-19 01:21:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 479 transitions. [2024-11-19 01:21:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 479 transitions. [2024-11-19 01:21:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:21:39,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:39,499 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:39,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:21:39,499 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:39,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1977535178, now seen corresponding path program 1 times [2024-11-19 01:21:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475475691] [2024-11-19 01:21:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:39,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475475691] [2024-11-19 01:21:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475475691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:21:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864379246] [2024-11-19 01:21:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:21:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:21:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:40,232 INFO L87 Difference]: Start difference. First operand 357 states and 479 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:40,765 INFO L93 Difference]: Finished difference Result 738 states and 991 transitions. [2024-11-19 01:21:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:21:40,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-11-19 01:21:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:40,768 INFO L225 Difference]: With dead ends: 738 [2024-11-19 01:21:40,768 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 01:21:40,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:21:40,771 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 143 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:40,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 790 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:21:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 01:21:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 349. [2024-11-19 01:21:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 294 states have (on average 1.2755102040816326) internal successors, (375), 298 states have internal predecessors, (375), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 01:21:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 469 transitions. [2024-11-19 01:21:40,851 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 469 transitions. Word has length 147 [2024-11-19 01:21:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:40,852 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 469 transitions. [2024-11-19 01:21:40,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 469 transitions. [2024-11-19 01:21:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:40,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:40,854 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:21:40,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 697585728, now seen corresponding path program 1 times [2024-11-19 01:21:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914545468] [2024-11-19 01:21:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914545468] [2024-11-19 01:21:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914545468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:41,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850358715] [2024-11-19 01:21:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:41,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:21:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:21:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:41,083 INFO L87 Difference]: Start difference. First operand 349 states and 469 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:41,325 INFO L93 Difference]: Finished difference Result 700 states and 942 transitions. [2024-11-19 01:21:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:21:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-11-19 01:21:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:41,328 INFO L225 Difference]: With dead ends: 700 [2024-11-19 01:21:41,329 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 01:21:41,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:21:41,330 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 32 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:41,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 453 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:21:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 01:21:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2024-11-19 01:21:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 298 states have (on average 1.2751677852348993) internal successors, (380), 302 states have internal predecessors, (380), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 01:21:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 474 transitions. [2024-11-19 01:21:41,422 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 474 transitions. Word has length 148 [2024-11-19 01:21:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:41,423 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 474 transitions. [2024-11-19 01:21:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:21:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 474 transitions. [2024-11-19 01:21:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:41,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:41,424 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:21:41,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1475214440, now seen corresponding path program 1 times [2024-11-19 01:21:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969092727] [2024-11-19 01:21:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969092727] [2024-11-19 01:21:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969092727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:42,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:21:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379262821] [2024-11-19 01:21:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:42,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:21:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:21:42,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:21:42,629 INFO L87 Difference]: Start difference. First operand 353 states and 474 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:43,404 INFO L93 Difference]: Finished difference Result 746 states and 1001 transitions. [2024-11-19 01:21:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:43,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-11-19 01:21:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:43,408 INFO L225 Difference]: With dead ends: 746 [2024-11-19 01:21:43,408 INFO L226 Difference]: Without dead ends: 421 [2024-11-19 01:21:43,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:21:43,410 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 514 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:43,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 348 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:21:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-19 01:21:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 362. [2024-11-19 01:21:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 308 states have internal predecessors, (385), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 01:21:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 483 transitions. [2024-11-19 01:21:43,489 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 483 transitions. Word has length 148 [2024-11-19 01:21:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 483 transitions. [2024-11-19 01:21:43,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 483 transitions. [2024-11-19 01:21:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:43,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:43,491 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:43,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:21:43,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash -113133462, now seen corresponding path program 1 times [2024-11-19 01:21:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692550055] [2024-11-19 01:21:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:44,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:44,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692550055] [2024-11-19 01:21:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692550055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:21:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47426593] [2024-11-19 01:21:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:44,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:21:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:44,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:21:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:44,696 INFO L87 Difference]: Start difference. First operand 362 states and 483 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:45,400 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2024-11-19 01:21:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-11-19 01:21:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:45,403 INFO L225 Difference]: With dead ends: 734 [2024-11-19 01:21:45,403 INFO L226 Difference]: Without dead ends: 408 [2024-11-19 01:21:45,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:21:45,405 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 210 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:45,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 470 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:21:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-19 01:21:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2024-11-19 01:21:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 338 states have (on average 1.257396449704142) internal successors, (425), 343 states have internal predecessors, (425), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 01:21:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 539 transitions. [2024-11-19 01:21:45,506 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 539 transitions. Word has length 148 [2024-11-19 01:21:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:45,506 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 539 transitions. [2024-11-19 01:21:45,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 539 transitions. [2024-11-19 01:21:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:45,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:45,509 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:21:45,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:45,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2142052996, now seen corresponding path program 1 times [2024-11-19 01:21:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297226646] [2024-11-19 01:21:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297226646] [2024-11-19 01:21:48,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297226646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 01:21:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904129442] [2024-11-19 01:21:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:48,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 01:21:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 01:21:48,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-19 01:21:48,003 INFO L87 Difference]: Start difference. First operand 405 states and 539 transitions. Second operand has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:49,314 INFO L93 Difference]: Finished difference Result 831 states and 1109 transitions. [2024-11-19 01:21:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:21:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-11-19 01:21:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:49,316 INFO L225 Difference]: With dead ends: 831 [2024-11-19 01:21:49,316 INFO L226 Difference]: Without dead ends: 462 [2024-11-19 01:21:49,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:21:49,318 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 443 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:49,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 560 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:21:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-19 01:21:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 456. [2024-11-19 01:21:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 380 states have (on average 1.2552631578947369) internal successors, (477), 386 states have internal predecessors, (477), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-19 01:21:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 607 transitions. [2024-11-19 01:21:49,399 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 607 transitions. Word has length 148 [2024-11-19 01:21:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 607 transitions. [2024-11-19 01:21:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 01:21:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 607 transitions. [2024-11-19 01:21:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:49,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:49,401 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:49,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:21:49,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:49,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1673669073, now seen corresponding path program 1 times [2024-11-19 01:21:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378816749] [2024-11-19 01:21:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378816749] [2024-11-19 01:21:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378816749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:51,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:51,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 01:21:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196537638] [2024-11-19 01:21:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:51,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:21:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:21:51,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:21:51,250 INFO L87 Difference]: Start difference. First operand 456 states and 607 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:52,262 INFO L93 Difference]: Finished difference Result 1012 states and 1345 transitions. [2024-11-19 01:21:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:21:52,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-11-19 01:21:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:52,266 INFO L225 Difference]: With dead ends: 1012 [2024-11-19 01:21:52,266 INFO L226 Difference]: Without dead ends: 592 [2024-11-19 01:21:52,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-11-19 01:21:52,270 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 276 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:52,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 723 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:21:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-19 01:21:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 474. [2024-11-19 01:21:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 398 states have (on average 1.2512562814070352) internal successors, (498), 404 states have internal predecessors, (498), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-19 01:21:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 628 transitions. [2024-11-19 01:21:52,401 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 628 transitions. Word has length 148 [2024-11-19 01:21:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 628 transitions. [2024-11-19 01:21:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 01:21:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 628 transitions. [2024-11-19 01:21:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:52,404 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:52,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 01:21:52,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1341434545, now seen corresponding path program 1 times [2024-11-19 01:21:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119132599] [2024-11-19 01:21:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:21:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119132599] [2024-11-19 01:21:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119132599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:21:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243340651] [2024-11-19 01:21:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:21:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:21:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:21:57,819 INFO L87 Difference]: Start difference. First operand 474 states and 628 transitions. Second operand has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:59,179 INFO L93 Difference]: Finished difference Result 1053 states and 1389 transitions. [2024-11-19 01:21:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:21:59,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2024-11-19 01:21:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:59,182 INFO L225 Difference]: With dead ends: 1053 [2024-11-19 01:21:59,182 INFO L226 Difference]: Without dead ends: 615 [2024-11-19 01:21:59,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:21:59,184 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 248 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:59,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 524 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:21:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-19 01:21:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 497. [2024-11-19 01:21:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 418 states have (on average 1.2511961722488039) internal successors, (523), 425 states have internal predecessors, (523), 67 states have call successors, (67), 11 states have call predecessors, (67), 11 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:21:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 657 transitions. [2024-11-19 01:21:59,292 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 657 transitions. Word has length 148 [2024-11-19 01:21:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:59,293 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 657 transitions. [2024-11-19 01:21:59,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-19 01:21:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 657 transitions. [2024-11-19 01:21:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:21:59,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:59,295 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 01:21:59,295 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1611629459, now seen corresponding path program 1 times [2024-11-19 01:21:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438865684] [2024-11-19 01:21:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat