./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:48:16,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:48:16,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:48:16,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:48:16,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:48:16,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:48:16,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:48:16,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:48:16,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:48:16,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:48:16,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:48:16,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:48:16,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:48:16,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:48:16,230 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:48:16,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:48:16,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:48:16,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:48:16,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:48:16,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:48:16,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:48:16,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:48:16,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:48:16,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:48:16,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:48:16,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:48:16,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:48:16,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:48:16,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:48:16,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:48:16,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:48:16,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:48:16,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:48:16,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:48:16,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:48:16,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:48:16,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:48:16,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:48:16,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:48:16,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:48:16,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:48:16,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:48:16,246 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 [2024-11-10 00:48:16,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:48:16,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:48:16,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:48:16,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:48:16,506 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:48:16,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:48:17,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:48:18,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:48:18,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:48:18,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474fe7050/1c473d102b754b0c99550bd14f7d2fbf/FLAGd1fc0d8f4 [2024-11-10 00:48:18,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474fe7050/1c473d102b754b0c99550bd14f7d2fbf [2024-11-10 00:48:18,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:48:18,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:48:18,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:48:18,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:48:18,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:48:18,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:48:18" (1/1) ... [2024-11-10 00:48:18,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbecd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:18, skipping insertion in model container [2024-11-10 00:48:18,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:48:18" (1/1) ... [2024-11-10 00:48:18,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:48:18,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2024-11-10 00:48:18,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2024-11-10 00:48:19,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:48:19,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:48:19,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2024-11-10 00:48:19,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2024-11-10 00:48:20,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:48:20,174 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:48:20,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20 WrapperNode [2024-11-10 00:48:20,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:48:20,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:48:20,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:48:20,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:48:20,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,667 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4981 [2024-11-10 00:48:20,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:48:20,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:48:20,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:48:20,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:48:20,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:48:20,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:20,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:48:21,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:48:21,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:48:21,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:48:21,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (1/1) ... [2024-11-10 00:48:21,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:48:21,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:21,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:48:21,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:48:21,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:48:21,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:48:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:48:21,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:48:21,342 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:48:21,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:48:26,753 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2024-11-10 00:48:26,754 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:48:26,754 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:48:27,055 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:48:27,056 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:48:27,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:48:27,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:48:27,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:48:27 BoogieIcfgContainer [2024-11-10 00:48:27,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:48:27,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:48:27,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:48:27,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:48:27,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:48:18" (1/3) ... [2024-11-10 00:48:27,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4037537b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:48:27, skipping insertion in model container [2024-11-10 00:48:27,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:48:20" (2/3) ... [2024-11-10 00:48:27,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4037537b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:48:27, skipping insertion in model container [2024-11-10 00:48:27,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:48:27" (3/3) ... [2024-11-10 00:48:27,114 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:48:27,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:48:27,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:48:27,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:48:27,228 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;@56d31dae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:48:27,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:48:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:48:27,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:27,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:27,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:27,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 516537996, now seen corresponding path program 1 times [2024-11-10 00:48:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780557248] [2024-11-10 00:48:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780557248] [2024-11-10 00:48:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780557248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:48:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396633297] [2024-11-10 00:48:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:27,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:48:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:48:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:48:27,506 INFO L87 Difference]: Start difference. First operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:27,605 INFO L93 Difference]: Finished difference Result 1736 states and 4650 transitions. [2024-11-10 00:48:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:48:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:48:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:27,636 INFO L225 Difference]: With dead ends: 1736 [2024-11-10 00:48:27,636 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:48:27,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:48:27,648 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:27,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:48:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:48:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.727496917385943) internal successors, (2212), 812 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2212 transitions. [2024-11-10 00:48:27,742 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2212 transitions. Word has length 22 [2024-11-10 00:48:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:27,743 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2212 transitions. [2024-11-10 00:48:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2212 transitions. [2024-11-10 00:48:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:48:27,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:27,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:27,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:48:27,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 6003819, now seen corresponding path program 1 times [2024-11-10 00:48:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351073828] [2024-11-10 00:48:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351073828] [2024-11-10 00:48:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351073828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068737686] [2024-11-10 00:48:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:27,932 INFO L87 Difference]: Start difference. First operand 813 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:28,040 INFO L93 Difference]: Finished difference Result 852 states and 2269 transitions. [2024-11-10 00:48:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:48:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:28,047 INFO L225 Difference]: With dead ends: 852 [2024-11-10 00:48:28,047 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:48:28,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:28,049 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6609 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:28,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:48:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:48:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.7077681874229347) internal successors, (2196), 812 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2196 transitions. [2024-11-10 00:48:28,086 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2196 transitions. Word has length 22 [2024-11-10 00:48:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:28,087 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2196 transitions. [2024-11-10 00:48:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2196 transitions. [2024-11-10 00:48:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:48:28,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:28,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:48:28,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:28,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1519636538, now seen corresponding path program 1 times [2024-11-10 00:48:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970733247] [2024-11-10 00:48:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:28,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970733247] [2024-11-10 00:48:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970733247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738653412] [2024-11-10 00:48:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:28,255 INFO L87 Difference]: Start difference. First operand 813 states and 2196 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:28,399 INFO L93 Difference]: Finished difference Result 1023 states and 2514 transitions. [2024-11-10 00:48:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:48:28,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:48:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:28,406 INFO L225 Difference]: With dead ends: 1023 [2024-11-10 00:48:28,407 INFO L226 Difference]: Without dead ends: 988 [2024-11-10 00:48:28,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:28,408 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 6708 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6708 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:28,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6708 Valid, 2492 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:48:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-10 00:48:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 845. [2024-11-10 00:48:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.663107947805457) internal successors, (2245), 844 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2245 transitions. [2024-11-10 00:48:28,483 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2245 transitions. Word has length 37 [2024-11-10 00:48:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:28,483 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2245 transitions. [2024-11-10 00:48:28,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2245 transitions. [2024-11-10 00:48:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:48:28,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:28,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:28,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:48:28,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2087439128, now seen corresponding path program 1 times [2024-11-10 00:48:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:28,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653904756] [2024-11-10 00:48:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653904756] [2024-11-10 00:48:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653904756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292276114] [2024-11-10 00:48:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:28,730 INFO L87 Difference]: Start difference. First operand 845 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:28,835 INFO L93 Difference]: Finished difference Result 915 states and 2349 transitions. [2024-11-10 00:48:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 00:48:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:28,840 INFO L225 Difference]: With dead ends: 915 [2024-11-10 00:48:28,840 INFO L226 Difference]: Without dead ends: 848 [2024-11-10 00:48:28,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:48:28,842 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 6478 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6478 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:28,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6478 Valid, 2289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-10 00:48:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 845. [2024-11-10 00:48:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.6619217081850532) internal successors, (2244), 844 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2244 transitions. [2024-11-10 00:48:28,874 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2244 transitions. Word has length 39 [2024-11-10 00:48:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:28,875 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2244 transitions. [2024-11-10 00:48:28,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2244 transitions. [2024-11-10 00:48:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:48:28,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:28,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:28,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:48:28,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1437715677, now seen corresponding path program 1 times [2024-11-10 00:48:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258203228] [2024-11-10 00:48:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258203228] [2024-11-10 00:48:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258203228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:28,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026453999] [2024-11-10 00:48:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:28,992 INFO L87 Difference]: Start difference. First operand 845 states and 2244 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:29,041 INFO L93 Difference]: Finished difference Result 967 states and 2426 transitions. [2024-11-10 00:48:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 00:48:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:29,047 INFO L225 Difference]: With dead ends: 967 [2024-11-10 00:48:29,047 INFO L226 Difference]: Without dead ends: 900 [2024-11-10 00:48:29,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,050 INFO L432 NwaCegarLoop]: 2192 mSDtfsCounter, 2152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:29,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2238 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-10 00:48:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 895. [2024-11-10 00:48:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 893 states have (on average 2.593505039193729) internal successors, (2316), 894 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2316 transitions. [2024-11-10 00:48:29,078 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2316 transitions. Word has length 40 [2024-11-10 00:48:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:29,080 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 2316 transitions. [2024-11-10 00:48:29,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2316 transitions. [2024-11-10 00:48:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:29,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:29,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:48:29,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:29,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1044566890, now seen corresponding path program 1 times [2024-11-10 00:48:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503095373] [2024-11-10 00:48:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503095373] [2024-11-10 00:48:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503095373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254107072] [2024-11-10 00:48:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,148 INFO L87 Difference]: Start difference. First operand 895 states and 2316 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:29,207 INFO L93 Difference]: Finished difference Result 1113 states and 2634 transitions. [2024-11-10 00:48:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:48:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:29,213 INFO L225 Difference]: With dead ends: 1113 [2024-11-10 00:48:29,213 INFO L226 Difference]: Without dead ends: 996 [2024-11-10 00:48:29,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,215 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2161 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:29,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 2283 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-10 00:48:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2024-11-10 00:48:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 991 states have (on average 2.477295660948537) internal successors, (2455), 992 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2455 transitions. [2024-11-10 00:48:29,250 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2455 transitions. Word has length 41 [2024-11-10 00:48:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:29,251 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 2455 transitions. [2024-11-10 00:48:29,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2455 transitions. [2024-11-10 00:48:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:29,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:29,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:29,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:48:29,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:29,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1158797654, now seen corresponding path program 1 times [2024-11-10 00:48:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496863227] [2024-11-10 00:48:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496863227] [2024-11-10 00:48:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496863227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:29,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:29,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037233044] [2024-11-10 00:48:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,308 INFO L87 Difference]: Start difference. First operand 993 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:29,348 INFO L93 Difference]: Finished difference Result 1391 states and 3023 transitions. [2024-11-10 00:48:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:48:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:29,354 INFO L225 Difference]: With dead ends: 1391 [2024-11-10 00:48:29,354 INFO L226 Difference]: Without dead ends: 1176 [2024-11-10 00:48:29,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,357 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 2159 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:29,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 2285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-10 00:48:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1173. [2024-11-10 00:48:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1171 states have (on average 2.3065755764304012) internal successors, (2701), 1172 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 2701 transitions. [2024-11-10 00:48:29,390 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 2701 transitions. Word has length 41 [2024-11-10 00:48:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:29,391 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 2701 transitions. [2024-11-10 00:48:29,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 2701 transitions. [2024-11-10 00:48:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:29,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:29,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:48:29,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1683074709, now seen corresponding path program 1 times [2024-11-10 00:48:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854860655] [2024-11-10 00:48:29,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854860655] [2024-11-10 00:48:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854860655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:48:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709708744] [2024-11-10 00:48:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:48:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:48:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:29,628 INFO L87 Difference]: Start difference. First operand 1173 states and 2701 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:29,744 INFO L93 Difference]: Finished difference Result 1200 states and 2735 transitions. [2024-11-10 00:48:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:48:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:48:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:29,750 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 00:48:29,751 INFO L226 Difference]: Without dead ends: 1197 [2024-11-10 00:48:29,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:29,752 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 13127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15317 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15317 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-10 00:48:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2024-11-10 00:48:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1195 states have (on average 2.276987447698745) internal successors, (2721), 1196 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2721 transitions. [2024-11-10 00:48:29,785 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2721 transitions. Word has length 41 [2024-11-10 00:48:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 2721 transitions. [2024-11-10 00:48:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2721 transitions. [2024-11-10 00:48:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 00:48:29,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:29,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:48:29,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1278516470, now seen corresponding path program 1 times [2024-11-10 00:48:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997540744] [2024-11-10 00:48:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997540744] [2024-11-10 00:48:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997540744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:29,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93053313] [2024-11-10 00:48:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:29,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:29,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:29,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,839 INFO L87 Difference]: Start difference. First operand 1197 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:29,886 INFO L93 Difference]: Finished difference Result 1655 states and 3362 transitions. [2024-11-10 00:48:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 00:48:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:29,897 INFO L225 Difference]: With dead ends: 1655 [2024-11-10 00:48:29,898 INFO L226 Difference]: Without dead ends: 1403 [2024-11-10 00:48:29,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:29,899 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 2160 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:29,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-10 00:48:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1400. [2024-11-10 00:48:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1398 states have (on average 2.140200286123033) internal successors, (2992), 1399 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2992 transitions. [2024-11-10 00:48:29,940 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2992 transitions. Word has length 43 [2024-11-10 00:48:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:29,940 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2992 transitions. [2024-11-10 00:48:29,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2992 transitions. [2024-11-10 00:48:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:48:29,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:29,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:48:29,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2051803116, now seen corresponding path program 1 times [2024-11-10 00:48:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723359831] [2024-11-10 00:48:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:48:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723359831] [2024-11-10 00:48:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723359831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379450775] [2024-11-10 00:48:30,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:30,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:30,114 INFO L87 Difference]: Start difference. First operand 1400 states and 2992 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:30,222 INFO L93 Difference]: Finished difference Result 3404 states and 5720 transitions. [2024-11-10 00:48:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:48:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:30,233 INFO L225 Difference]: With dead ends: 3404 [2024-11-10 00:48:30,234 INFO L226 Difference]: Without dead ends: 2785 [2024-11-10 00:48:30,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:30,236 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4428 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:30,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4538 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-10 00:48:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2016. [2024-11-10 00:48:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.8987090367428003) internal successors, (3824), 2015 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3824 transitions. [2024-11-10 00:48:30,289 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3824 transitions. Word has length 58 [2024-11-10 00:48:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:30,290 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3824 transitions. [2024-11-10 00:48:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3824 transitions. [2024-11-10 00:48:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:48:30,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:30,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:30,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:48:30,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:30,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -151561428, now seen corresponding path program 1 times [2024-11-10 00:48:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620320906] [2024-11-10 00:48:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:48:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620320906] [2024-11-10 00:48:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620320906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:30,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903269768] [2024-11-10 00:48:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:30,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:30,397 INFO L87 Difference]: Start difference. First operand 2016 states and 3824 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:30,517 INFO L93 Difference]: Finished difference Result 4020 states and 6552 transitions. [2024-11-10 00:48:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:30,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:48:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:30,530 INFO L225 Difference]: With dead ends: 4020 [2024-11-10 00:48:30,531 INFO L226 Difference]: Without dead ends: 3401 [2024-11-10 00:48:30,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:30,533 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4433 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:30,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 4527 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2024-11-10 00:48:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2944. [2024-11-10 00:48:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2942 states have (on average 1.7212780421481986) internal successors, (5064), 2943 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5064 transitions. [2024-11-10 00:48:30,650 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5064 transitions. Word has length 58 [2024-11-10 00:48:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 5064 transitions. [2024-11-10 00:48:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5064 transitions. [2024-11-10 00:48:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:48:30,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:30,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:30,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:48:30,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:30,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1612801138, now seen corresponding path program 1 times [2024-11-10 00:48:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72181544] [2024-11-10 00:48:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72181544] [2024-11-10 00:48:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72181544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442324080] [2024-11-10 00:48:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:30,743 INFO L87 Difference]: Start difference. First operand 2944 states and 5064 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:30,796 INFO L93 Difference]: Finished difference Result 4536 states and 7243 transitions. [2024-11-10 00:48:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:30,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:48:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:30,805 INFO L225 Difference]: With dead ends: 4536 [2024-11-10 00:48:30,805 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 00:48:30,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:30,808 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 35 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:30,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4403 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 00:48:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2370. [2024-11-10 00:48:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2368 states have (on average 1.8133445945945945) internal successors, (4294), 2369 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 4294 transitions. [2024-11-10 00:48:30,868 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 4294 transitions. Word has length 60 [2024-11-10 00:48:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 4294 transitions. [2024-11-10 00:48:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 4294 transitions. [2024-11-10 00:48:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:48:30,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:30,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:30,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:48:30,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:30,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 307855116, now seen corresponding path program 1 times [2024-11-10 00:48:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462491085] [2024-11-10 00:48:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:48:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462491085] [2024-11-10 00:48:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462491085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439170425] [2024-11-10 00:48:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:30,963 INFO L87 Difference]: Start difference. First operand 2370 states and 4294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:31,057 INFO L93 Difference]: Finished difference Result 3726 states and 6150 transitions. [2024-11-10 00:48:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:31,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:48:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:31,069 INFO L225 Difference]: With dead ends: 3726 [2024-11-10 00:48:31,069 INFO L226 Difference]: Without dead ends: 3275 [2024-11-10 00:48:31,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:31,072 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4431 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4431 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:31,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4431 Valid, 4554 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2024-11-10 00:48:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2818. [2024-11-10 00:48:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2816 states have (on average 1.7407670454545454) internal successors, (4902), 2817 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4902 transitions. [2024-11-10 00:48:31,148 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4902 transitions. Word has length 60 [2024-11-10 00:48:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4902 transitions. [2024-11-10 00:48:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4902 transitions. [2024-11-10 00:48:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:48:31,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:31,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:31,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:48:31,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:31,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1577745881, now seen corresponding path program 1 times [2024-11-10 00:48:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840016980] [2024-11-10 00:48:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840016980] [2024-11-10 00:48:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840016980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:31,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:31,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094803548] [2024-11-10 00:48:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:48:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:48:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:48:31,264 INFO L87 Difference]: Start difference. First operand 2818 states and 4902 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:38,856 INFO L93 Difference]: Finished difference Result 5077 states and 11255 transitions. [2024-11-10 00:48:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:48:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:48:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:38,867 INFO L225 Difference]: With dead ends: 5077 [2024-11-10 00:48:38,867 INFO L226 Difference]: Without dead ends: 4322 [2024-11-10 00:48:38,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:38,869 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 4373 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:38,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4373 Valid, 793 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-10 00:48:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2024-11-10 00:48:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 4322. [2024-11-10 00:48:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 4320 states have (on average 1.9421296296296295) internal successors, (8390), 4321 states have internal predecessors, (8390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 8390 transitions. [2024-11-10 00:48:38,975 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 8390 transitions. Word has length 62 [2024-11-10 00:48:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:38,975 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 8390 transitions. [2024-11-10 00:48:38,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 8390 transitions. [2024-11-10 00:48:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:48:38,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:38,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:38,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:48:38,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:38,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1785383598, now seen corresponding path program 1 times [2024-11-10 00:48:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274913021] [2024-11-10 00:48:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274913021] [2024-11-10 00:48:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274913021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867893616] [2024-11-10 00:48:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:39,070 INFO L87 Difference]: Start difference. First operand 4322 states and 8390 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:39,211 INFO L93 Difference]: Finished difference Result 5336 states and 9762 transitions. [2024-11-10 00:48:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:48:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:39,222 INFO L225 Difference]: With dead ends: 5336 [2024-11-10 00:48:39,223 INFO L226 Difference]: Without dead ends: 3317 [2024-11-10 00:48:39,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:39,225 INFO L432 NwaCegarLoop]: 2215 mSDtfsCounter, 28 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4388 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:39,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4388 Invalid, 5 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2024-11-10 00:48:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3314. [2024-11-10 00:48:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3312 states have (on average 2.114734299516908) internal successors, (7004), 3313 states have internal predecessors, (7004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 7004 transitions. [2024-11-10 00:48:39,309 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 7004 transitions. Word has length 62 [2024-11-10 00:48:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:39,310 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 7004 transitions. [2024-11-10 00:48:39,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 7004 transitions. [2024-11-10 00:48:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:48:39,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:39,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:39,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:48:39,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash -909439056, now seen corresponding path program 1 times [2024-11-10 00:48:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088385408] [2024-11-10 00:48:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:39,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088385408] [2024-11-10 00:48:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088385408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185558268] [2024-11-10 00:48:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:39,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:39,396 INFO L87 Difference]: Start difference. First operand 3314 states and 7004 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:39,436 INFO L93 Difference]: Finished difference Result 3824 states and 7683 transitions. [2024-11-10 00:48:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:48:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:39,442 INFO L225 Difference]: With dead ends: 3824 [2024-11-10 00:48:39,442 INFO L226 Difference]: Without dead ends: 2813 [2024-11-10 00:48:39,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:39,444 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 23 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:39,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4373 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2024-11-10 00:48:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2810. [2024-11-10 00:48:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2808 states have (on average 2.2507122507122506) internal successors, (6320), 2809 states have internal predecessors, (6320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6320 transitions. [2024-11-10 00:48:39,495 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6320 transitions. Word has length 64 [2024-11-10 00:48:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:39,495 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 6320 transitions. [2024-11-10 00:48:39,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6320 transitions. [2024-11-10 00:48:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:48:39,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:39,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:48:39,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1765907433, now seen corresponding path program 1 times [2024-11-10 00:48:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152322495] [2024-11-10 00:48:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152322495] [2024-11-10 00:48:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152322495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402270450] [2024-11-10 00:48:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:39,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:39,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:48:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:39,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:48:39,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:40,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402270450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:41,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:48:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465784195] [2024-11-10 00:48:41,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:48:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:48:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:48:41,206 INFO L87 Difference]: Start difference. First operand 2810 states and 6320 transitions. Second operand has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:41,641 INFO L93 Difference]: Finished difference Result 3881 states and 7739 transitions. [2024-11-10 00:48:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:48:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:48:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:41,648 INFO L225 Difference]: With dead ends: 3881 [2024-11-10 00:48:41,649 INFO L226 Difference]: Without dead ends: 3374 [2024-11-10 00:48:41,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2024-11-10 00:48:41,651 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 24193 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24193 SdHoareTripleChecker+Valid, 6625 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:41,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24193 Valid, 6625 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:48:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2024-11-10 00:48:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 3350. [2024-11-10 00:48:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3348 states have (on average 2.09468339307049) internal successors, (7013), 3349 states have internal predecessors, (7013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 7013 transitions. [2024-11-10 00:48:41,813 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 7013 transitions. Word has length 66 [2024-11-10 00:48:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:41,813 INFO L471 AbstractCegarLoop]: Abstraction has 3350 states and 7013 transitions. [2024-11-10 00:48:41,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 7013 transitions. [2024-11-10 00:48:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:48:41,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:41,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:41,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:48:42,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:48:42,016 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:42,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash 248454647, now seen corresponding path program 1 times [2024-11-10 00:48:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3207357] [2024-11-10 00:48:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:42,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:42,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3207357] [2024-11-10 00:48:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3207357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664294399] [2024-11-10 00:48:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:42,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:42,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:42,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:42,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:48:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:42,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 00:48:42,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:45,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664294399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:49,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 23] total 49 [2024-11-10 00:48:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737544050] [2024-11-10 00:48:49,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 00:48:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 00:48:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 00:48:49,028 INFO L87 Difference]: Start difference. First operand 3350 states and 7013 transitions. Second operand has 50 states, 50 states have (on average 3.48) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:53,259 INFO L93 Difference]: Finished difference Result 9938 states and 15488 transitions. [2024-11-10 00:48:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-10 00:48:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:48:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:53,277 INFO L225 Difference]: With dead ends: 9938 [2024-11-10 00:48:53,277 INFO L226 Difference]: Without dead ends: 8891 [2024-11-10 00:48:53,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2910 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2212, Invalid=7688, Unknown=0, NotChecked=0, Total=9900 [2024-11-10 00:48:53,284 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 16878 mSDsluCounter, 25086 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16878 SdHoareTripleChecker+Valid, 27314 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:53,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16878 Valid, 27314 Invalid, 1471 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:48:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8891 states. [2024-11-10 00:48:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8891 to 4970. [2024-11-10 00:48:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 4968 states have (on average 1.8246779388083736) internal successors, (9065), 4969 states have internal predecessors, (9065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 9065 transitions. [2024-11-10 00:48:53,428 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 9065 transitions. Word has length 66 [2024-11-10 00:48:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:53,428 INFO L471 AbstractCegarLoop]: Abstraction has 4970 states and 9065 transitions. [2024-11-10 00:48:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 9065 transitions. [2024-11-10 00:48:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:48:53,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:53,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:53,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:48:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:48:53,634 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1553759899, now seen corresponding path program 1 times [2024-11-10 00:48:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793412747] [2024-11-10 00:48:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793412747] [2024-11-10 00:48:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793412747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841392696] [2024-11-10 00:48:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:54,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:54,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:54,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:48:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:54,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:48:54,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:55,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841392696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:56,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 41 [2024-11-10 00:48:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067964259] [2024-11-10 00:48:56,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 00:48:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 00:48:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:48:56,636 INFO L87 Difference]: Start difference. First operand 4970 states and 9065 transitions. Second operand has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 41 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:04,584 INFO L93 Difference]: Finished difference Result 10662 states and 16298 transitions. [2024-11-10 00:49:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-10 00:49:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 41 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:49:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:04,601 INFO L225 Difference]: With dead ends: 10662 [2024-11-10 00:49:04,602 INFO L226 Difference]: Without dead ends: 8895 [2024-11-10 00:49:04,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2840 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2412, Invalid=8930, Unknown=0, NotChecked=0, Total=11342 [2024-11-10 00:49:04,610 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 23798 mSDsluCounter, 36026 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23798 SdHoareTripleChecker+Valid, 38268 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:04,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23798 Valid, 38268 Invalid, 1710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:49:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8895 states. [2024-11-10 00:49:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 5838. [2024-11-10 00:49:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 5836 states have (on average 1.7364633310486635) internal successors, (10134), 5837 states have internal predecessors, (10134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 10134 transitions. [2024-11-10 00:49:04,802 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 10134 transitions. Word has length 67 [2024-11-10 00:49:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 5838 states and 10134 transitions. [2024-11-10 00:49:04,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 41 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 10134 transitions. [2024-11-10 00:49:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:49:04,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:04,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:04,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:49:05,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:05,009 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:05,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -436943354, now seen corresponding path program 1 times [2024-11-10 00:49:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136360980] [2024-11-10 00:49:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:06,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136360980] [2024-11-10 00:49:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136360980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346556593] [2024-11-10 00:49:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:06,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:06,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:06,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:06,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:49:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:06,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 00:49:06,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:08,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:11,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346556593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:11,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:11,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 21] total 62 [2024-11-10 00:49:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436920934] [2024-11-10 00:49:11,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-10 00:49:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-10 00:49:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3434, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 00:49:11,801 INFO L87 Difference]: Start difference. First operand 5838 states and 10134 transitions. Second operand has 62 states, 62 states have (on average 2.935483870967742) internal successors, (182), 62 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)