./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-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:01:08,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:01:08,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:01:08,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:01:08,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:01:08,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:01:08,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:01:08,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:01:08,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:01:08,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:01:08,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:01:08,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:01:08,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:01:08,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:01:08,686 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:01:08,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:01:08,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:01:08,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:01:08,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:01:08,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:01:08,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:01:08,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:01:08,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:01:08,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:01:08,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:01:08,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:01:08,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:01:08,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:01:08,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:01:08,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:01:08,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:01:08,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:01:08,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:08,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:01:08,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:01:08,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:01:08,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:01:08,694 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-clean/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-clean/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 -> 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d [2024-10-11 14:01:08,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:01:08,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:01:08,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:01:08,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:01:08,958 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:01:08,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-11 14:01:10,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:01:10,422 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:01:10,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-11 14:01:10,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c9983e0c/28151f5d7f9540ab81cd27dd88be591f/FLAG2b40ac009 [2024-10-11 14:01:10,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c9983e0c/28151f5d7f9540ab81cd27dd88be591f [2024-10-11 14:01:10,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:01:10,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:01:10,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:10,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:01:10,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:01:10,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:10" (1/1) ... [2024-10-11 14:01:10,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23433152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:10, skipping insertion in model container [2024-10-11 14:01:10,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:10" (1/1) ... [2024-10-11 14:01:10,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:01:10,987 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-58.i[917,930] [2024-10-11 14:01:11,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:11,131 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:01:11,143 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-58.i[917,930] [2024-10-11 14:01:11,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:11,191 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:01:11,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11 WrapperNode [2024-10-11 14:01:11,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:11,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:11,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:01:11,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:01:11,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,262 INFO L138 Inliner]: procedures = 26, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-10-11 14:01:11,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:11,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:01:11,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:01:11,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:01:11,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,303 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-11 14:01:11,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:01:11,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:01:11,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:01:11,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:01:11,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (1/1) ... [2024-10-11 14:01:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:11,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:01:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:01:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:01:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:01:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:01:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:01:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:01:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:01:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:01:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:01:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:01:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:01:11,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:01:11,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:01:11,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:01:11,863 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-11 14:01:11,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:01:11,898 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:01:11,898 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:01:11,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:11 BoogieIcfgContainer [2024-10-11 14:01:11,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:01:11,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:01:11,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:01:11,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:01:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:01:10" (1/3) ... [2024-10-11 14:01:11,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d6a9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:11, skipping insertion in model container [2024-10-11 14:01:11,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:11" (2/3) ... [2024-10-11 14:01:11,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d6a9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:11, skipping insertion in model container [2024-10-11 14:01:11,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:11" (3/3) ... [2024-10-11 14:01:11,908 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-11 14:01:11,923 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:01:11,924 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:01:11,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:01:11,986 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;@727075a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:01:11,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:01:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:12,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:12,003 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:12,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1527237723, now seen corresponding path program 1 times [2024-10-11 14:01:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400781705] [2024-10-11 14:01:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400781705] [2024-10-11 14:01:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400781705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:01:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628952627] [2024-10-11 14:01:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:12,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:01:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:01:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:12,388 INFO L87 Difference]: Start difference. First operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:12,427 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2024-10-11 14:01:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:01:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-11 14:01:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:12,441 INFO L225 Difference]: With dead ends: 163 [2024-10-11 14:01:12,442 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 14:01:12,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:12,450 INFO L432 NwaCegarLoop]: 109 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, 109 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-11 14:01:12,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 14:01:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 14:01:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-10-11 14:01:12,488 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 111 [2024-10-11 14:01:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:12,489 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-10-11 14:01:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-10-11 14:01:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:12,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:12,511 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:01:12,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:12,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1590311997, now seen corresponding path program 1 times [2024-10-11 14:01:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231001530] [2024-10-11 14:01:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231001530] [2024-10-11 14:01:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231001530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:12,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435884268] [2024-10-11 14:01:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:12,820 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:12,865 INFO L93 Difference]: Finished difference Result 160 states and 229 transitions. [2024-10-11 14:01:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-11 14:01:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:12,869 INFO L225 Difference]: With dead ends: 160 [2024-10-11 14:01:12,869 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 14:01:12,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-11 14:01:12,870 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:12,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 14:01:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-11 14:01:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-11 14:01:12,886 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 111 [2024-10-11 14:01:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:12,888 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-11 14:01:12,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-11 14:01:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:12,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:12,890 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:12,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:01:12,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:12,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1590252415, now seen corresponding path program 1 times [2024-10-11 14:01:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:12,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447777223] [2024-10-11 14:01:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447777223] [2024-10-11 14:01:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447777223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:14,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421946769] [2024-10-11 14:01:14,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:14,178 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:14,729 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. [2024-10-11 14:01:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:14,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-11 14:01:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:14,734 INFO L225 Difference]: With dead ends: 199 [2024-10-11 14:01:14,734 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 14:01:14,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:01:14,735 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 220 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:14,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 235 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:01:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 14:01:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2024-10-11 14:01:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-11 14:01:14,755 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 111 [2024-10-11 14:01:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:14,756 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-11 14:01:14,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-11 14:01:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:14,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:14,757 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:01:14,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822536, now seen corresponding path program 1 times [2024-10-11 14:01:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154838888] [2024-10-11 14:01:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154838888] [2024-10-11 14:01:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154838888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:16,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:01:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717906254] [2024-10-11 14:01:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:16,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:01:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:01:16,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:16,688 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 14:01:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:17,279 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-10-11 14:01:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:01:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 111 [2024-10-11 14:01:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:17,281 INFO L225 Difference]: With dead ends: 222 [2024-10-11 14:01:17,282 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 14:01:17,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:17,283 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 417 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:17,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 282 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:01:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 14:01:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2024-10-11 14:01:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-10-11 14:01:17,305 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 111 [2024-10-11 14:01:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-10-11 14:01:17,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 14:01:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-10-11 14:01:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:17,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:17,307 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:01:17,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash -488757958, now seen corresponding path program 1 times [2024-10-11 14:01:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724259800] [2024-10-11 14:01:17,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724259800] [2024-10-11 14:01:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724259800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:19,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316494368] [2024-10-11 14:01:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:19,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:19,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:19,977 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 14:01:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:21,151 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-10-11 14:01:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:01:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 111 [2024-10-11 14:01:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:21,153 INFO L225 Difference]: With dead ends: 233 [2024-10-11 14:01:21,153 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 14:01:21,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:21,154 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 274 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:21,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 319 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:01:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 14:01:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-10-11 14:01:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-10-11 14:01:21,175 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 111 [2024-10-11 14:01:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-10-11 14:01:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 14:01:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-10-11 14:01:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:21,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:21,177 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:01:21,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2084076406, now seen corresponding path program 1 times [2024-10-11 14:01:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005439354] [2024-10-11 14:01:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005439354] [2024-10-11 14:01:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005439354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:22,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:22,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:22,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414879898] [2024-10-11 14:01:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:22,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:22,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:22,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:22,273 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:23,037 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-10-11 14:01:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-11 14:01:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:23,039 INFO L225 Difference]: With dead ends: 237 [2024-10-11 14:01:23,039 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 14:01:23,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:01:23,040 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 156 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:23,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 272 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:01:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 14:01:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2024-10-11 14:01:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-11 14:01:23,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 111 [2024-10-11 14:01:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-11 14:01:23,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-11 14:01:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 14:01:23,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:23,062 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:01:23,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1509826312, now seen corresponding path program 1 times [2024-10-11 14:01:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403106497] [2024-10-11 14:01:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403106497] [2024-10-11 14:01:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403106497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653025247] [2024-10-11 14:01:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:23,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:23,520 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:23,959 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2024-10-11 14:01:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:01:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-11 14:01:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:23,961 INFO L225 Difference]: With dead ends: 238 [2024-10-11 14:01:23,961 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 14:01:23,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:01:23,962 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 120 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:23,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 14:01:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2024-10-11 14:01:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-11 14:01:23,979 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 111 [2024-10-11 14:01:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-11 14:01:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-11 14:01:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:23,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:23,981 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:23,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:01:23,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1669361993, now seen corresponding path program 1 times [2024-10-11 14:01:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510911092] [2024-10-11 14:01:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510911092] [2024-10-11 14:01:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510911092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977962668] [2024-10-11 14:01:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:24,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:24,744 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:25,396 INFO L93 Difference]: Finished difference Result 258 states and 359 transitions. [2024-10-11 14:01:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-10-11 14:01:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:25,398 INFO L225 Difference]: With dead ends: 258 [2024-10-11 14:01:25,398 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 14:01:25,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:01:25,399 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 249 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:25,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 331 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 14:01:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-10-11 14:01:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2024-10-11 14:01:25,411 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 112 [2024-10-11 14:01:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:25,411 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2024-10-11 14:01:25,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:01:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2024-10-11 14:01:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:25,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:25,412 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:25,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:01:25,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:25,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash -968297415, now seen corresponding path program 1 times [2024-10-11 14:01:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:25,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511696382] [2024-10-11 14:01:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511696382] [2024-10-11 14:01:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511696382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438324056] [2024-10-11 14:01:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:26,974 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:27,624 INFO L93 Difference]: Finished difference Result 267 states and 373 transitions. [2024-10-11 14:01:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-11 14:01:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:27,628 INFO L225 Difference]: With dead ends: 267 [2024-10-11 14:01:27,629 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 14:01:27,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:27,630 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 288 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:27,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 238 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 14:01:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2024-10-11 14:01:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2024-10-11 14:01:27,642 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 112 [2024-10-11 14:01:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2024-10-11 14:01:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2024-10-11 14:01:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:27,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:27,644 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:27,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:01:27,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1268932114, now seen corresponding path program 1 times [2024-10-11 14:01:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:27,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423952979] [2024-10-11 14:01:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423952979] [2024-10-11 14:01:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423952979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039744031] [2024-10-11 14:01:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:28,189 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:28,682 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2024-10-11 14:01:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-10-11 14:01:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:28,684 INFO L225 Difference]: With dead ends: 261 [2024-10-11 14:01:28,684 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 14:01:28,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:01:28,685 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 187 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:28,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 271 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:01:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 14:01:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2024-10-11 14:01:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2024-10-11 14:01:28,700 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 161 transitions. Word has length 112 [2024-10-11 14:01:28,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:28,701 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 161 transitions. [2024-10-11 14:01:28,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 14:01:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2024-10-11 14:01:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:28,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:28,702 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:28,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:01:28,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1037257401, now seen corresponding path program 1 times [2024-10-11 14:01:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398793750] [2024-10-11 14:01:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398793750] [2024-10-11 14:01:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398793750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067991031] [2024-10-11 14:01:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:30,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:30,358 INFO L87 Difference]: Start difference. First operand 117 states and 161 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:30,968 INFO L93 Difference]: Finished difference Result 257 states and 353 transitions. [2024-10-11 14:01:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-11 14:01:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:30,971 INFO L225 Difference]: With dead ends: 257 [2024-10-11 14:01:30,971 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 14:01:30,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:30,972 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 144 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:30,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 236 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 14:01:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2024-10-11 14:01:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2024-10-11 14:01:30,985 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 112 [2024-10-11 14:01:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2024-10-11 14:01:30,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2024-10-11 14:01:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:30,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:30,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:01:30,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1738321979, now seen corresponding path program 1 times [2024-10-11 14:01:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102109901] [2024-10-11 14:01:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102109901] [2024-10-11 14:01:32,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102109901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 14:01:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23321599] [2024-10-11 14:01:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:01:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:01:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:32,377 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:33,318 INFO L93 Difference]: Finished difference Result 257 states and 351 transitions. [2024-10-11 14:01:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:01:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-11 14:01:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:33,319 INFO L225 Difference]: With dead ends: 257 [2024-10-11 14:01:33,319 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 14:01:33,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:33,320 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:33,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 499 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:01:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 14:01:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2024-10-11 14:01:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-10-11 14:01:33,330 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 112 [2024-10-11 14:01:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-10-11 14:01:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 14:01:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-10-11 14:01:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 14:01:33,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:33,331 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:01:33,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 419043591, now seen corresponding path program 1 times [2024-10-11 14:01:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634660748] [2024-10-11 14:01:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:33,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:01:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634660748] [2024-10-11 14:01:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634660748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 14:01:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662835028] [2024-10-11 14:01:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:35,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:01:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:01:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:35,058 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 14:01:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:35,929 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2024-10-11 14:01:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:01:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 113 [2024-10-11 14:01:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:35,934 INFO L225 Difference]: With dead ends: 270 [2024-10-11 14:01:35,934 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 14:01:35,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:35,934 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 364 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:35,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 407 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:01:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 14:01:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-10-11 14:01:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 117 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 14:01:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2024-10-11 14:01:35,951 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 113 [2024-10-11 14:01:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:35,951 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2024-10-11 14:01:35,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 14:01:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2024-10-11 14:01:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:01:35,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:35,953 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:35,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:01:35,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:35,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -72732070, now seen corresponding path program 1 times [2024-10-11 14:01:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661345155] [2024-10-11 14:01:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat