./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.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 cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:04:10,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:04:10,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:04:10,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:04:10,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:04:10,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:04:10,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:04:10,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:04:10,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:04:10,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:04:10,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:04:10,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:04:10,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:04:10,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:04:10,163 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:04:10,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:04:10,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:04:10,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:04:10,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:04:10,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:04:10,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:04:10,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:04:10,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:04:10,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:04:10,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:04:10,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:04:10,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:04:10,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:04:10,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:04:10,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:04:10,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:04:10,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:04:10,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:10,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:04:10,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:04:10,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:04:10,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:04:10,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:04:10,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:04:10,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:04:10,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:04:10,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:04:10,176 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 -> cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 [2024-10-24 12:04:10,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:04:10,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:04:10,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:04:10,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:04:10,445 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:04:10,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-24 12:04:11,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:04:12,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:04:12,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-24 12:04:12,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ab1139e/9c4c71902f9443dd95169f3ad85811cb/FLAG570046309 [2024-10-24 12:04:12,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ab1139e/9c4c71902f9443dd95169f3ad85811cb [2024-10-24 12:04:12,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:04:12,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:04:12,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:12,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:04:12,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:04:12,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e851c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12, skipping insertion in model container [2024-10-24 12:04:12,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:04:12,248 WARN L248 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-89.i[917,930] [2024-10-24 12:04:12,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:12,298 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:04:12,311 WARN L248 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-89.i[917,930] [2024-10-24 12:04:12,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:12,380 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:04:12,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12 WrapperNode [2024-10-24 12:04:12,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:12,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:12,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:04:12,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:04:12,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,455 INFO L138 Inliner]: procedures = 26, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-10-24 12:04:12,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:12,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:04:12,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:04:12,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:04:12,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,511 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-24 12:04:12,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:04:12,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:04:12,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:04:12,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:04:12,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (1/1) ... [2024-10-24 12:04:12,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:12,595 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-10-24 12:04:12,599 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-10-24 12:04:12,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:04:12,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:04:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:04:12,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:04:12,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:04:12,743 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:04:12,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:04:13,242 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-24 12:04:13,242 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:04:13,274 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:04:13,274 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:04:13,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:13 BoogieIcfgContainer [2024-10-24 12:04:13,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:04:13,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:04:13,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:04:13,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:04:13,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:04:12" (1/3) ... [2024-10-24 12:04:13,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d04eb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:13, skipping insertion in model container [2024-10-24 12:04:13,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:12" (2/3) ... [2024-10-24 12:04:13,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d04eb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:13, skipping insertion in model container [2024-10-24 12:04:13,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:13" (3/3) ... [2024-10-24 12:04:13,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-24 12:04:13,300 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:04:13,301 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:04:13,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:04:13,370 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;@27654f43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:04:13,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:04:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:13,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:13,389 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:13,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1381092916, now seen corresponding path program 1 times [2024-10-24 12:04:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:13,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556897411] [2024-10-24 12:04:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556897411] [2024-10-24 12:04:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556897411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:04:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234486593] [2024-10-24 12:04:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:13,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:04:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:04:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:13,725 INFO L87 Difference]: Start difference. First operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 12:04:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:13,766 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-24 12:04:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:04:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-24 12:04:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:13,776 INFO L225 Difference]: With dead ends: 187 [2024-10-24 12:04:13,776 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 12:04:13,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-10-24 12:04:13,784 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:13,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 12:04:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 12:04:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-10-24 12:04:13,834 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 104 [2024-10-24 12:04:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:13,835 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-10-24 12:04:13,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 12:04:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-10-24 12:04:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:13,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:13,840 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:13,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:04:13,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1783485146, now seen corresponding path program 1 times [2024-10-24 12:04:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855474910] [2024-10-24 12:04:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:14,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855474910] [2024-10-24 12:04:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855474910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:14,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329733946] [2024-10-24 12:04:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:14,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:14,201 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:14,254 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2024-10-24 12:04:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:14,259 INFO L225 Difference]: With dead ends: 188 [2024-10-24 12:04:14,260 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 12:04:14,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-10-24 12:04:14,262 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:14,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 12:04:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 12:04:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2024-10-24 12:04:14,276 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 104 [2024-10-24 12:04:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2024-10-24 12:04:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2024-10-24 12:04:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:14,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:14,283 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:14,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:04:14,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:14,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 974138520, now seen corresponding path program 1 times [2024-10-24 12:04:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355530485] [2024-10-24 12:04:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355530485] [2024-10-24 12:04:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355530485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12568042] [2024-10-24 12:04:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:14,538 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:14,582 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-10-24 12:04:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:14,584 INFO L225 Difference]: With dead ends: 192 [2024-10-24 12:04:14,585 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 12:04:14,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-10-24 12:04:14,586 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:14,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 12:04:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 12:04:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-10-24 12:04:14,598 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 104 [2024-10-24 12:04:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-10-24 12:04:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-10-24 12:04:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:14,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:14,602 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:14,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:04:14,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:14,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1031396822, now seen corresponding path program 1 times [2024-10-24 12:04:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525008003] [2024-10-24 12:04:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:14,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525008003] [2024-10-24 12:04:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525008003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:14,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445367287] [2024-10-24 12:04:14,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:14,797 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:14,837 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-10-24 12:04:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:14,844 INFO L225 Difference]: With dead ends: 196 [2024-10-24 12:04:14,844 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 12:04:14,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-10-24 12:04:14,850 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:14,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 12:04:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 12:04:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-10-24 12:04:14,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 104 [2024-10-24 12:04:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-10-24 12:04:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-10-24 12:04:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:14,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:14,865 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:14,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:04:14,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1031456404, now seen corresponding path program 1 times [2024-10-24 12:04:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302574852] [2024-10-24 12:04:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302574852] [2024-10-24 12:04:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302574852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:16,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:16,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374396085] [2024-10-24 12:04:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:16,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:16,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:16,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:16,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:16,886 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:17,572 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-10-24 12:04:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:04:17,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:17,575 INFO L225 Difference]: With dead ends: 260 [2024-10-24 12:04:17,575 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 12:04:17,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:04:17,576 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 339 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:17,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 531 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 12:04:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 110. [2024-10-24 12:04:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 12:04:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-24 12:04:17,596 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 104 [2024-10-24 12:04:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:17,596 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-24 12:04:17,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-24 12:04:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:17,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:17,597 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:04:17,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -248407274, now seen corresponding path program 1 times [2024-10-24 12:04:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823945714] [2024-10-24 12:04:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823945714] [2024-10-24 12:04:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823945714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:04:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584205281] [2024-10-24 12:04:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:19,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:04:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:04:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:19,372 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-24 12:04:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:20,069 INFO L93 Difference]: Finished difference Result 284 states and 405 transitions. [2024-10-24 12:04:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:20,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) Word has length 104 [2024-10-24 12:04:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:20,071 INFO L225 Difference]: With dead ends: 284 [2024-10-24 12:04:20,071 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 12:04:20,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:20,072 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 443 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:20,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 444 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:04:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 12:04:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-10-24 12:04:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 152 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:04:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2024-10-24 12:04:20,088 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 104 [2024-10-24 12:04:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2024-10-24 12:04:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-24 12:04:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2024-10-24 12:04:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:20,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:20,089 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:04:20,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 903292637, now seen corresponding path program 1 times [2024-10-24 12:04:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:20,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147856131] [2024-10-24 12:04:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147856131] [2024-10-24 12:04:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147856131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:23,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:23,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:04:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203781557] [2024-10-24 12:04:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:23,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:04:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:23,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:04:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:23,497 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:25,800 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2024-10-24 12:04:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:04:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-24 12:04:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:25,803 INFO L225 Difference]: With dead ends: 490 [2024-10-24 12:04:25,803 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 12:04:25,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:25,806 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 185 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 476 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 12:04:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 12:04:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 219. [2024-10-24 12:04:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 186 states have (on average 1.3602150537634408) internal successors, (253), 187 states have internal predecessors, (253), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2024-10-24 12:04:25,831 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 104 [2024-10-24 12:04:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:25,831 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2024-10-24 12:04:25,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2024-10-24 12:04:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:25,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:25,832 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:04:25,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1454158230, now seen corresponding path program 1 times [2024-10-24 12:04:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471998721] [2024-10-24 12:04:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471998721] [2024-10-24 12:04:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471998721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:27,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:04:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715129677] [2024-10-24 12:04:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:04:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:04:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:27,095 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:27,624 INFO L93 Difference]: Finished difference Result 462 states and 652 transitions. [2024-10-24 12:04:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-24 12:04:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:27,627 INFO L225 Difference]: With dead ends: 462 [2024-10-24 12:04:27,627 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 12:04:27,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:27,629 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 529 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:27,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 386 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 12:04:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2024-10-24 12:04:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 203 states have internal predecessors, (277), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2024-10-24 12:04:27,658 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 104 [2024-10-24 12:04:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:27,658 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2024-10-24 12:04:27,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2024-10-24 12:04:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:27,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:27,660 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:27,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:04:27,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:27,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 174294552, now seen corresponding path program 1 times [2024-10-24 12:04:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897733478] [2024-10-24 12:04:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897733478] [2024-10-24 12:04:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897733478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926820963] [2024-10-24 12:04:28,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:28,224 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:28,725 INFO L93 Difference]: Finished difference Result 469 states and 666 transitions. [2024-10-24 12:04:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:04:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:28,728 INFO L225 Difference]: With dead ends: 469 [2024-10-24 12:04:28,728 INFO L226 Difference]: Without dead ends: 287 [2024-10-24 12:04:28,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:04:28,730 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 180 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:28,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1040 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-24 12:04:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 239. [2024-10-24 12:04:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 206 states have internal predecessors, (281), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2024-10-24 12:04:28,758 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 104 [2024-10-24 12:04:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:28,759 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2024-10-24 12:04:28,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2024-10-24 12:04:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:28,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:28,761 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:04:28,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:28,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash 99088159, now seen corresponding path program 1 times [2024-10-24 12:04:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282637748] [2024-10-24 12:04:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282637748] [2024-10-24 12:04:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282637748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:04:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559109636] [2024-10-24 12:04:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:04:29,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:04:29,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:29,943 INFO L87 Difference]: Start difference. First operand 239 states and 339 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:30,422 INFO L93 Difference]: Finished difference Result 497 states and 705 transitions. [2024-10-24 12:04:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-24 12:04:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:30,425 INFO L225 Difference]: With dead ends: 497 [2024-10-24 12:04:30,426 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 12:04:30,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:30,427 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 315 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:30,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 380 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 12:04:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 244. [2024-10-24 12:04:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 210 states have (on average 1.3761904761904762) internal successors, (289), 211 states have internal predecessors, (289), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-10-24 12:04:30,454 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 104 [2024-10-24 12:04:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:30,454 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-10-24 12:04:30,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-10-24 12:04:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:30,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:30,455 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:30,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:04:30,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:30,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1180775519, now seen corresponding path program 1 times [2024-10-24 12:04:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:30,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232130314] [2024-10-24 12:04:30,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232130314] [2024-10-24 12:04:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232130314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:31,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055503963] [2024-10-24 12:04:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:31,174 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:31,566 INFO L93 Difference]: Finished difference Result 491 states and 700 transitions. [2024-10-24 12:04:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:04:31,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:31,569 INFO L225 Difference]: With dead ends: 491 [2024-10-24 12:04:31,569 INFO L226 Difference]: Without dead ends: 301 [2024-10-24 12:04:31,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:04:31,570 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 297 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:31,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 638 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-24 12:04:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 240. [2024-10-24 12:04:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 206 states have (on average 1.3689320388349515) internal successors, (282), 207 states have internal predecessors, (282), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2024-10-24 12:04:31,599 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 104 [2024-10-24 12:04:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2024-10-24 12:04:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2024-10-24 12:04:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:31,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:31,601 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:04:31,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:31,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash -29075608, now seen corresponding path program 1 times [2024-10-24 12:04:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051409692] [2024-10-24 12:04:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:32,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051409692] [2024-10-24 12:04:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051409692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:04:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278268362] [2024-10-24 12:04:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:04:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:04:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:32,812 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:33,340 INFO L93 Difference]: Finished difference Result 503 states and 711 transitions. [2024-10-24 12:04:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-24 12:04:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:33,344 INFO L225 Difference]: With dead ends: 503 [2024-10-24 12:04:33,345 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 12:04:33,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:33,346 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 663 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:33,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 436 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 12:04:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 255. [2024-10-24 12:04:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 222 states have internal predecessors, (306), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 364 transitions. [2024-10-24 12:04:33,377 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 364 transitions. Word has length 104 [2024-10-24 12:04:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:33,379 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 364 transitions. [2024-10-24 12:04:33,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 12:04:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 364 transitions. [2024-10-24 12:04:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:33,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:33,380 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:33,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:04:33,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1308939286, now seen corresponding path program 1 times [2024-10-24 12:04:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888954281] [2024-10-24 12:04:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 12:04:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888954281] [2024-10-24 12:04:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888954281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859047971] [2024-10-24 12:04:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:33,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:33,982 INFO L87 Difference]: Start difference. First operand 255 states and 364 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:34,422 INFO L93 Difference]: Finished difference Result 505 states and 719 transitions. [2024-10-24 12:04:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:04:34,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 12:04:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:34,425 INFO L225 Difference]: With dead ends: 505 [2024-10-24 12:04:34,425 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 12:04:34,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:04:34,427 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 244 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:34,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 988 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 12:04:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2024-10-24 12:04:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 224 states have internal predecessors, (308), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 12:04:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 366 transitions. [2024-10-24 12:04:34,456 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 366 transitions. Word has length 104 [2024-10-24 12:04:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:34,463 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 366 transitions. [2024-10-24 12:04:34,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 12:04:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 366 transitions. [2024-10-24 12:04:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 12:04:34,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:34,464 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:04:34,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:04:34,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -323613667, now seen corresponding path program 1 times [2024-10-24 12:04:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025689344] [2024-10-24 12:04:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat